CLL H 3
Optimum 7 moves
23 algorithms
First algorithm: (U) L2 y' L U2 x L2 U2 L U2
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).
Optimum 7 moves
23 algorithms
First algorithm: (U) L2 y' L U2 x L2 U2 L U2
Optimum 10 moves
20 algorithms
First algorithm: x' U L' U' L y L2 U2 L' U L U2
Optimum 5 moves
20 algorithms
First algorithm: L2 U2 L U2 L2
Optimum 10 moves
21 algorithms
First algorithm: (U') L2 U L U' L2 U2 x' U L' U' L
Optimum 9 moves
21 algorithms
First algorithm: (U) z U R' U2 R U2 R U2 R' U
Optimum 9 moves
24 algorithms
First algorithm: (U') z U2 R' y U2 R U2 R' y' U2 R U2
Optimum 9 moves
26 algorithms
First algorithm: B y U2 B' U2 B' U2 B y' U2 B'
Optimum 6 moves
25 algorithms
First algorithm: L B L B' x B' L'
Optimum 9 moves
26 algorithms
First algorithm: (U) L U' x' U' L U' L' U L' U
Optimum 10 moves
29 algorithms
First algorithm: (U') x2 R U' R' U' R2 U' R' U2 R' U'
Optimum 9 moves
23 algorithms
First algorithm: (U2) x' L' U L' y U L' U L U2 x' U2
Optimum 9 moves
23 algorithms
First algorithm: (U) L' y' U2 L U2 L' U2 L' y U2 L
Optimum 7 moves
19 algorithms
First algorithm: (U') L' B L B' x L B L'
Optimum 9 moves
17 algorithms
First algorithm: (U) x' U2 L' U x U2 L' U2 x' U' L U2
Optimum 8 moves
22 algorithms
First algorithm: (U') B' U B y B' U2 B' U2 B
Optimum 8 moves
16 algorithms
First algorithm: L' U2 L U2 L y' L' U' L
Optimum 7 moves
17 algorithms
First algorithm: (U) L U' x' L' U L' U' L
Optimum 9 moves
20 algorithms
First algorithm: (U') x' U2 L' U x U2 L U2 x' U' L U2
Optimum 8 moves
15 algorithms
First algorithm: L U' L' y' L U2 L U2 L'
Optimum 8 moves
19 algorithms
First algorithm: (U') B U2 B' U2 B' y B U B'
Optimum 9 moves
23 algorithms
First algorithm: (U) x' L' U' L y L' U2 L U' L' U2
Optimum 9 moves
30 algorithms
First algorithm: L B' L B' U L U2 B2 L'
Optimum 9 moves
24 algorithms
First algorithm: (U') B' L B' L B L' B x B L'
Optimum 10 moves
25 algorithms
First algorithm: L2 U2 L' U2 L' U x' U L' U' L'
Optimum 10 moves
21 algorithms
First algorithm: L y' U' L' U' L U2 x U' L U2 L'
Optimum 10 moves
19 algorithms
First algorithm: (U2) L U2 L' B U2 L' B L U B'
Optimum 9 moves
19 algorithms
First algorithm: (U') z U' B U2 B' y' U B2 U' B' U2
Optimum 9 moves
23 algorithms
First algorithm: L2 U L U2 x' L' U L2 U' L
Optimum 9 moves
21 algorithms
First algorithm: (U) z U2 R' U R U2 R y R U2 R'
Optimum 9 moves
21 algorithms
First algorithm: (U') L2 U x' L' U2 L U' L' U2 L'
Optimum 7 moves
18 algorithms
First algorithm: L U L' U L U2 L'
Optimum 7 moves
21 algorithms
First algorithm: L U2 L' U' L U' L'
Optimum 7 moves
26 algorithms
First algorithm: (U') L U L' y' U' L' U' L
Optimum 7 moves
20 algorithms
First algorithm: B' U' B y U B U B'
Optimum 9 moves
24 algorithms
First algorithm: (U') x' L' U2 L y L U2 L U L' U2
Optimum 9 moves
27 algorithms
First algorithm: z B U2 B' y' B' U2 B' U' B U2
Optimum 7 moves
20 algorithms
First algorithm: (U') B' U B y U B U' B'
Optimum 7 moves
18 algorithms
First algorithm: L U' L' y' U' L' U L
Optimum 9 moves
22 algorithms
First algorithm: L U x' L2 U2 L U L' U2 L
Optimum 9 moves
26 algorithms
First algorithm: L2 U' L U2 L' U2 L U' L2
Optimum 9 moves
16 algorithms
First algorithm: (U2) L' U x' L' U2 L U' L' U2 L2
Optimum 11 moves
15 algorithms
First algorithm: L B' U2 B' L' B' L U2 B L' B
No case matches these filters.