PF

Only the last three triples remain: the U corners, U triangles and the triangles just below U on F, BL and BR in the CIF hold. The U parts of the R, L and B centres are aligned with each other up to U. Form pairs for the three-step L3T finish.

10 cases · 8,787 algorithms

Proven optimum for 7 cases out of 10; for the others, the page gives the length of the shortest algorithm offered and a bound.

16 writings are played from a representative position of the case. They reach the goal shown in the dialog without necessarily solving the whole puzzle.

Definition of the set: LowCubes.

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 1

At least 7 moves

454 algorithms

First algorithm: L R F' D' R D R' F L' R'

Case 2

At least 7 moves

273 algorithms

First algorithm: R L' F' R F' L' F R' F' L F' R' L

Case 3

Optimum 4 moves

1,102 algorithms

First algorithm: (U') L Fw' R' Fw

Case 4

Optimum 4 moves

992 algorithms

First algorithm: (U') R L' R' L

Case 5

At least 7 moves

1,020 algorithms

First algorithm: (U) BR R U L' R' L R U' R' BR'

Case 6

Optimum 4 moves

1,074 algorithms

First algorithm: (U') R L' R' L

Case 7

Optimum 4 moves

1,064 algorithms

First algorithm: (U) Fw L' Fw' R

Case 8

Optimum 6 moves

970 algorithms

First algorithm: (U) Lw' R L R' 2L

Case 9

Optimum 4 moves

991 algorithms

First algorithm: L Fw' R' Fw

Case 10

Optimum 6 moves

847 algorithms

First algorithm: Rw L' R' L 2R'