BTLT

F2L is solved except for the last triple: its corner and triangles on D and the front face in the EIF hold. U is free, with its large centre turning as a unit. Solve the corner and bottom triangle of the last triple.

23 cases · 156 algorithms

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

Definition of the set: Malte Ihlefeld, 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.

S ufL

Optimum 6 moves

3 algorithms

First algorithm: (U) L Rw F Rw' U' L'

S ufR

Optimum 6 moves

3 algorithms

First algorithm: L' F' U' F U L

S dR

At least 7 moves

1 algorithm

First algorithm: L BLw U BL' U' BL BLw' L' BLv BLv'

T Dr

At least 7 moves

5 algorithms

First algorithm: BL U BL' L BL U' BL' U L'

T ufL

At least 7 moves

3 algorithms

First algorithm: U F Lw U' L U' Lw' F L' Lv Lv'

T ufR

At least 7 moves

6 algorithms

First algorithm: (U') U BL' Lw' U L' U Lw BL' L Lv' Lv

T dR

Optimum 6 moves

7 algorithms

First algorithm: Rw F' Rw' F' U' F

B Dr

At least 7 moves

20 algorithms

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

B ufL

Optimum 3 moves

3 algorithms

First algorithm: Rw F' Rw'

B ubL

Optimum 6 moves

2 algorithms

First algorithm: (U') L Rw' U Rw F' L'

B uBr

Optimum 6 moves

5 algorithms

First algorithm: L F' U' F U L'

B uBl

At least 7 moves

8 algorithms

First algorithm: (U) U L' BL U BL' F' U' F L

B dR

Optimum 6 moves

7 algorithms

First algorithm: L U' F' U F L'

B ufR

Optimum 6 moves

5 algorithms

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

B ubR

Optimum 6 moves

2 algorithms

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

F Dr

At least 7 moves

43 algorithms

First algorithm: (U) U L Lw BL U BL' U' L' Lw' Lv Lv'

F ubR

Optimum 6 moves

4 algorithms

First algorithm: L Rw F' Rw' U L'

F ufR

Optimum 6 moves

2 algorithms

First algorithm: (U') L U' Rw F Rw' L'

F ubL

At least 7 moves

11 algorithms

First algorithm: L F' Lw' F Lw U' F L' Lv' Lv

F ufL

Optimum 6 moves

6 algorithms

First algorithm: (U) L' Rw F Rw' U' L

F dR

Optimum 6 moves

6 algorithms

First algorithm: L' U Rw F' Rw' L

F uBr

Optimum 3 moves

2 algorithms

First algorithm: F' U' F

F uBl

Optimum 6 moves

2 algorithms

First algorithm: (U') L' F Rw' U' Rw L