TCP, even

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. Pairs are formed with two triples flipped and the third in place. The lower triangles form a three-cycle. Finish the even TCP subset.

6 cases · 433 algorithms

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

Definition of the set: public sheet.

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.

No. 5

At least 9 moves

85 algorithms

First algorithm: (U) Uv' y U L F' Lw U L' U' Lw' U' F Lv Lv' y' Uv

No. 1

Optimum 4 moves

45 algorithms

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

No. 2

Optimum 4 moves

47 algorithms

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

No. 6

At least 9 moves

85 algorithms

First algorithm: (U') Uv y F' L' U BR' U' L U BR F U' y' Uv'

No. 4

Optimum 8 moves

84 algorithms

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

No. 3

Optimum 8 moves

87 algorithms

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