5x5 and 6x6 center practice
Redux mode: center solutions without F3E restrictions.
Apply a scramble and find your shortest solution.
Only the original 18 center stickers are colored.
Apply a scramble or generate a random case.
Equivalent algorithms only count once.
Wide setups Rw, Lw', 3Rw, and 3Lw' use U turns. M uses F turns; M' uses U turns. U/F adjustments are allowed before and between blocks. Every setup must be followed immediately by its allowed U/F turn. Moves are counted after cancellations and combined layer turns.
One case at a time. Your sessions stay saved here.
Set up from solved centers. Release Space to start, press to stop.
| # | Time | Case | Scramble |
|---|
Experimental optimal search. One scramble at a time.
Random scramble filter: last two bars keeps the front center's two left columns orange; last bar keeps its three left columns orange.
Only the original 32 center stickers are colored. All 96 centers are tracked.
Pattern tables are reused across scrambles and saved separately for each move set. Prepare them ahead of time, or let the first deeper search build them.
Apply a short scramble to start.
Redux searches U, F, Rw, 3Rw, 4Rw, 5Rw, Lw, 3Lw, 4Lw, and 5Lw. Yau searches U, Rw, 3Rw, 4Rw, and 5Rw. Both include primes and doubles, each costing one move. A result is shortest within that move set, not all cube moves. Yau preserves all FL/DL/BL edge pieces as they are when search starts.
All six centers must return to their original faces. Edges and corners are not solved. IDA* uses exact small pattern tables to prune paths and avoids retaining the entire search frontier. Search stops at the chosen depth or time limit. There is no state cap; Cancel remains available. Longer scrambles can exceed these limits. No case database is generated.
Ergonomic search uses setup + U/U'/U2 + inverse setup blocks, with standalone U adjustments before, between, or after blocks. Setups are Rw through 5Rw or individual slices 2r through 5r, with primes allowed. Each slice counts as one move; adjacent wide/slice turns are combined when possible. An optional final commutator solves the last exchanged oblique pair, including verified symmetric/inverse variants and U/F alignment. In Yau, F actions use safe wide-turn equivalents. It minimizes written moves after adjacent turns combine, including across the final commutator boundary, not the number of blocks. This is optimal within those blocks and the supported finishing commutators; its slice-turn move set differs from the ordinary move-optimal search.