Opposite
At least 7 moves
69 algorithms
First algorithm: x' Rw2 D2 Rw' U2 Rw D2 Rw' U2 Rw'
L2E
Centres are solved. Only the edges at UF and UB remain unpaired; corners and paired-edge positions are free. Unpaired edges at adjacent or skew positions are outside this set. Pair the last two edges held opposite each other.
2 cases · 226 algorithms
No proven optimum for this set: the page gives the length of the shortest algorithm offered and a lower bound.
Definition of the set: CubePal.
How to read this page
- Each case is seen at three quarters: top, front and right faces, plus the top layer's back and left stickers as flat strips.
- Colours of the puzzle in the application. Grey marks what the case does not look at.
- Lengths: each move counts 1, an inner slice 2, a rotation 0. The "setup" presents the puzzle as drawn and does not count.
- In each case, the best available optimal algorithm comes first, then the others by increasing ease score. When no optimal writing is available, all algorithms are ranked by this score (lower is easier).
- "Play" starts from a position of the case and runs the algorithm to the set’s goal. Usually, the starting position is obtained by running the algorithm backwards from the solved puzzle. For a partial goal, the player may start from a representative position of the case in the application; the puzzle is not necessarily fully solved at the end.
Diagonal
At least 7 moves
157 algorithms
First algorithm: Rw' F' U L' F U' Rw
No case matches these filters.