L3C

Only the U layer remains: its three corners and six side triangles are free. The large U centre, including its edges and U triangles, may turn as a unit. The six side triangles are aligned with the U centre. Solve the last three corners after the triangles.

5 cases · 24 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: public sheet, Nautilus FTO.

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.

L5

At least 9 moves

4 algorithms

First algorithm: Lv L D' L U L' D L U' L Lv'

L4

At least 9 moves

3 algorithms

First algorithm: Lv L' U L' D' L U' L' D L' Lv'

L2

At least 9 moves

5 algorithms

First algorithm: (U) BLw' L U' L' BLw U BLw' L U' L' BLw BLv' BLv BLv' BLv

L3

At least 9 moves

7 algorithms

First algorithm: (U') y U' BL B BL' U L' U' BL B BL' U y'

L1

At least 9 moves

5 algorithms

First algorithm: (U) BL' B' BL U BL' U' B BLw U BL U' BLw' U' BLv BLv'