L4C (Ranzha)

The D layer is solved and the U corners are in their slots. At least one side centre is solved; three or four centres remain unsolved. Solve the centres without requiring U corner orientation.

6 cases · 377 algorithms

Proven optimum for every case.

Definition of the set: Ranzha.

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.

Za

Optimum 8 moves

74 algorithms

First algorithm: R L B' U L' B' L' R

Zb

Optimum 8 moves

74 algorithms

First algorithm: R U R' U' B' R' B U

H

Optimum 4 moves

45 algorithms

First algorithm: R' B U L'

Ob

Optimum 7 moves

34 algorithms

First algorithm: U' R L' U' L R' B'

U

Optimum 6 moves

121 algorithms

First algorithm: L' B' L' U R L

Oa

Optimum 7 moves

29 algorithms

First algorithm: U L R' B U R' B