Case 1
At least 9 moves
4 algorithms
First algorithm: Lv L D' L U L' D L U' L Lv'
L3C, corner permutation
The last-layer triangles are aligned with the U centre, the U corners are oriented and everything below U is solved. Permute the oriented last three corners.
2 cases · 7 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: Nautilus FTO, public site.
How to read this page
- Each case is drawn on a flat net of the puzzle’s faces. Grey marks the stickers that the case does not constrain.
- 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.
Case 2
At least 9 moves
3 algorithms
First algorithm: Lv L' U L' D' L U' L' D L' Lv'
No case matches these filters.