Case 1
Optimum 9 moves
15 algorithms
First algorithm: (U2) R U' R U x R' U R' U' R2
LS-1
The three D corners at DBL, DBR and DFL form a solved V. The fourth D corner is in U; its D sticker faces U. A U corner occupies DFR with its U sticker facing D. The other U corners are free. Solve the last slot and top layer with D toward U and U toward D.
54 cases · 593 algorithms
Proven optimum for every case.
Definition of the set: Speedsolving wiki (1LLS), public sheet, Speedsolving wiki (MLS), public sheet.
How to read this page
- Each case is seen at three quarters: top, front and right faces, plus the top layer's back and left stickers as flat strips.
- 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 2
Optimum 6 moves
12 algorithms
First algorithm: (U2) y2 L2 B' L2 B L2 B
Case 3
Optimum 7 moves
10 algorithms
First algorithm: (U2) R' y' R U2 x' R2 U2 R U
Case 4
Optimum 8 moves
13 algorithms
First algorithm: (U) y2 B L' B' x L' B L B' L2
Case 5
Optimum 9 moves
12 algorithms
First algorithm: x U' B U' B' y' U B' U B U2
Case 6
Optimum 7 moves
12 algorithms
First algorithm: (U) y' R y R' U2 x R2 U2 R' U'
Case 7
Optimum 6 moves
9 algorithms
First algorithm: (U') x U2 R U2 R' U2 R'
Case 8
Optimum 8 moves
12 algorithms
First algorithm: (U') x R' U R y U R' U' R U2
Case 9
Optimum 9 moves
13 algorithms
First algorithm: (U') x U2 B U2 B2 U B' U B' U2
Case 10
Optimum 9 moves
12 algorithms
First algorithm: (U2) x U2 B U' B U B2 U2 B U2
Case 11
Optimum 7 moves
13 algorithms
First algorithm: x U2 R' y U' R y' R' U' R2
Case 12
Optimum 7 moves
9 algorithms
First algorithm: x R2 U' R y R' y' U R' U2
Case 13
Optimum 6 moves
10 algorithms
First algorithm: (U') y2 B' L2 B' L2 B L2
Case 14
Optimum 9 moves
12 algorithms
First algorithm: y L U' L' U L U2 x U' L U
Case 15
Optimum 7 moves
8 algorithms
First algorithm: (U2) R U2 R' U2 R U2 R'
Case 16
Optimum 8 moves
10 algorithms
First algorithm: (U) x U2 B' U B y' U' B' U' B
Case 17
Optimum 7 moves
9 algorithms
First algorithm: y' R' U2 R y U' R U2 R'
Case 18
Optimum 7 moves
10 algorithms
First algorithm: R U2 R' y' U R' U2 R
Case 19
Optimum 7 moves
8 algorithms
First algorithm: (U) x U2 R y U' R y' R' U R2
Case 20
Optimum 7 moves
11 algorithms
First algorithm: x R U R' y U2 R U x U2
Case 21
Optimum 8 moves
8 algorithms
First algorithm: (U') x R2 y U2 R U R' y' U R' U2
Case 22
Optimum 9 moves
13 algorithms
First algorithm: (U2) x R' U' R y R' U R2 U R U'
Case 23
Optimum 8 moves
11 algorithms
First algorithm: x R U2 R U2 R' y U R' U
Case 24
Optimum 8 moves
10 algorithms
First algorithm: x U' B y' U' B U2 B' U2 B'
Case 25
Optimum 9 moves
13 algorithms
First algorithm: (U') R U2 R2 U' R2 U' R U2 R
Case 26
Optimum 9 moves
14 algorithms
First algorithm: (U2) R' U2 R' U R2 U R2 U2 R'
Case 27
Optimum 8 moves
10 algorithms
First algorithm: x R U' x' U R U' x U R' U2
Case 28
Optimum 7 moves
10 algorithms
First algorithm: (U2) R' y' R U2 R' U2 R' y R'
Case 29
Optimum 8 moves
9 algorithms
First algorithm: (U') x U2 R U' x' U R' U' x U R'
Case 30
Optimum 8 moves
9 algorithms
First algorithm: (U2) x R2 U' R y R' U R y' R' U
Case 31
Optimum 7 moves
10 algorithms
First algorithm: (U) R y' R U2 R U2 R' y R
Case 32
Optimum 7 moves
8 algorithms
First algorithm: (U2) y L' y L' U2 L' U2 L y' L'
Case 33
Optimum 8 moves
11 algorithms
First algorithm: (U) x R2 U' x' R U' R U x R2 U2
Case 34
Optimum 8 moves
8 algorithms
First algorithm: (U2) x U2 R y U' R U' R' U2 x U2
Case 35
Optimum 9 moves
14 algorithms
First algorithm: (U) R' U R U2 R U' x U R' U'
Case 36
Optimum 9 moves
13 algorithms
First algorithm: y L U' L' U2 L' U x U' L U
Case 37
Optimum 5 moves
12 algorithms
First algorithm: (U') x U' R' U2 R U
Case 38
Optimum 8 moves
12 algorithms
First algorithm: (U) x U' B' y' U' B U2 B' U2 B'
Case 39
Optimum 9 moves
11 algorithms
First algorithm: (U') x U2 R U' R U2 R' U R' U2
Case 40
Optimum 8 moves
11 algorithms
First algorithm: x R U2 R U2 R' y U R U
Case 41
Optimum 7 moves
9 algorithms
First algorithm: (U) y L' U2 L U2 L' U2 L
Case 42
Optimum 8 moves
11 algorithms
First algorithm: (U') R2 U R' U' x R U R U'
Case 43
Optimum 6 moves
10 algorithms
First algorithm: (U2) x R U2 R U2 R' U2
Case 44
Optimum 9 moves
12 algorithms
First algorithm: (U2) R' U R U' R' U2 x U R' U'
Case 45
Optimum 8 moves
11 algorithms
First algorithm: (U) x U' R y R' U' R y' R' U R2
Case 46
Optimum 7 moves
10 algorithms
First algorithm: (U) y L y L' U2 L U2 L y' L
Case 47
Optimum 8 moves
10 algorithms
First algorithm: x U2 z' U2 B' U' B y U' B U2
Case 48
Optimum 9 moves
14 algorithms
First algorithm: (U') x U R U' x' U R' U2 R' U' R
Case 49
Optimum 7 moves
11 algorithms
First algorithm: (U2) x R2 B' U2 B R2 B' U2
Case 50
Optimum 10 moves
14 algorithms
First algorithm: x R' U R y R' U2 R' y' R' U' R U2
Case 51
Optimum 5 moves
11 algorithms
First algorithm: (U2) x U2 B' U2 B U2
Case 52
Optimum 9 moves
14 algorithms
First algorithm: (U) x R' U' R y R' U2 R y' R' U R
Case 53
Optimum 5 moves
8 algorithms
First algorithm: (U) z' U2 L U2 L' U2
Case 54
Optimum 7 moves
11 algorithms
First algorithm: (U') x U2 B R2 B' U2 B R2
No case matches these filters.