CLL

The bottom layer is done; one algorithm solves the whole top layer. 42 cases, sorted by top face shape.

42 cases · 905 algorithms

Proven optimum for every case.

Definition of the set: Speedsolving wiki (CLL), Speedsolving wiki (EG Method).

How to read this page

Each case is seen from above: the top face in the middle, the top layer's stickers on its sides, the front face at the bottom.
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.

CLL H 3

Optimum 7 moves

23 algorithms

First algorithm: (U) L2 y' L U2 x L2 U2 L U2

CLL Pi 4

Optimum 10 moves

20 algorithms

First algorithm: x' U L' U' L y L2 U2 L' U L U2

CLL H 4

Optimum 5 moves

20 algorithms

First algorithm: L2 U2 L U2 L2

CLL H 2

Optimum 10 moves

21 algorithms

First algorithm: (U') L2 U L U' L2 U2 x' U L' U' L

CLL Pi 6

Optimum 9 moves

21 algorithms

First algorithm: (U) z U R' U2 R U2 R U2 R' U

CLL Pi 5

Optimum 9 moves

24 algorithms

First algorithm: (U') z U2 R' y U2 R U2 R' y' U2 R U2

CLL H 1

Optimum 9 moves

26 algorithms

First algorithm: B y U2 B' U2 B' U2 B y' U2 B'

CLL U 1

Optimum 6 moves

25 algorithms

First algorithm: L B L B' x B' L'

CLL T 5

Optimum 9 moves

26 algorithms

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

CLL U 3

Optimum 10 moves

29 algorithms

First algorithm: (U') x2 R U' R' U' R2 U' R' U2 R' U'

CLL T 4

Optimum 9 moves

23 algorithms

First algorithm: (U2) x' L' U L' y U L' U L U2 x' U2

CLL Pi 3

Optimum 9 moves

23 algorithms

First algorithm: (U) L' y' U2 L U2 L' U2 L' y U2 L

CLL AS 4

Optimum 7 moves

19 algorithms

First algorithm: (U') L' B L B' x L B L'

CLL Sune 2

Optimum 9 moves

17 algorithms

First algorithm: (U) x' U2 L' U x U2 L' U2 x' U' L U2

CLL AS 3

Optimum 8 moves

22 algorithms

First algorithm: (U') B' U B y B' U2 B' U2 B

CLL Sune 1

Optimum 8 moves

16 algorithms

First algorithm: L' U2 L U2 L y' L' U' L

CLL Sune 3

Optimum 7 moves

17 algorithms

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

CLL AS 6

Optimum 9 moves

20 algorithms

First algorithm: (U') x' U2 L' U x U2 L U2 x' U' L U2

CLL Sune 4

Optimum 8 moves

15 algorithms

First algorithm: L U' L' y' L U2 L U2 L'

CLL AS 5

Optimum 8 moves

19 algorithms

First algorithm: (U') B U2 B' U2 B' y B U B'

CLL T 6

Optimum 9 moves

23 algorithms

First algorithm: (U) x' L' U' L y L' U2 L U' L' U2

CLL U 2

Optimum 9 moves

30 algorithms

First algorithm: L B' L B' U L U2 B2 L'

CLL U 4

Optimum 9 moves

24 algorithms

First algorithm: (U') B' L B' L B L' B x B L'

CLL T 3

Optimum 10 moves

25 algorithms

First algorithm: L2 U2 L' U2 L' U x' U L' U' L'

CLL Pi 1

Optimum 10 moves

21 algorithms

First algorithm: L y' U' L' U' L U2 x U' L U2 L'

CLL Pi 2

Optimum 10 moves

19 algorithms

First algorithm: (U2) L U2 L' B U2 L' B L U B'

CLL Sune 5

Optimum 9 moves

19 algorithms

First algorithm: (U') z U' B U2 B' y' U B2 U' B' U2

CLL AS 2

Optimum 9 moves

23 algorithms

First algorithm: L2 U L U2 x' L' U L2 U' L

CLL U 5

Optimum 9 moves

21 algorithms

First algorithm: (U) z U2 R' U R U2 R y R U2 R'

CLL U 6

Optimum 9 moves

21 algorithms

First algorithm: (U') L2 U x' L' U2 L U' L' U2 L'

CLL Sune 6

Optimum 7 moves

18 algorithms

First algorithm: L U L' U L U2 L'

CLL AS 1

Optimum 7 moves

21 algorithms

First algorithm: L U2 L' U' L U' L'

CLL T 2

Optimum 7 moves

26 algorithms

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

CLL T 1

Optimum 7 moves

20 algorithms

First algorithm: B' U' B y U B U B'

CLL L 1

Optimum 9 moves

24 algorithms

First algorithm: (U') x' L' U2 L y L U2 L U L' U2

CLL L 2

Optimum 9 moves

27 algorithms

First algorithm: z B U2 B' y' B' U2 B' U' B U2

CLL L 6

Optimum 7 moves

20 algorithms

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

CLL L 5

Optimum 7 moves

18 algorithms

First algorithm: L U' L' y' U' L' U L

CLL L 4

Optimum 9 moves

22 algorithms

First algorithm: L U x' L2 U2 L U L' U2 L

CLL L 3

Optimum 9 moves

26 algorithms

First algorithm: L2 U' L U2 L' U2 L U' L2

Adjacent

Optimum 9 moves

16 algorithms

First algorithm: (U2) L' U x' L' U2 L U' L' U2 L2

Diagonal

Optimum 11 moves

15 algorithms

First algorithm: L B' U2 B' L' B' L U2 B L' B