PLL
The top face is done; one algorithm puts all its pieces in place. 151 cases.
151 cases · 3,439 algorithms
No proven optimum for this set: the page gives the shortest known length and a lower bound.
Definition of the set: Speedsolving wiki (Megaminx PLL), Reinier Schippers, nogesma, Lars Vandenbergh's archive.
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 optimal algorithm comes first, then the others from the easiest to the hardest to execute (ease score, lower is easier).
- "Play" starts from the case (the inverse of the algorithm applied to the solved cube) and runs the algorithm on the 3D cube.
U group
4 cases · 90 algorithms
A group
4 cases · 93 algorithms
J group
6 cases · 152 algorithms
Z group
3 cases · 70 algorithms
F group
10 cases · 235 algorithms
D group
2 cases · 43 algorithms
M group
1 cases · 26 algorithms
E group
3 cases · 69 algorithms
V group
8 cases · 186 algorithms
B group
4 cases · 92 algorithms
P group
8 cases · 194 algorithms
I group
12 cases · 276 algorithms
S group
12 cases · 275 algorithms
N group
4 cases · 73 algorithms
Y group
6 cases · 145 algorithms
C group
12 cases · 278 algorithms
R group
8 cases · 180 algorithms
T group
7 cases · 156 algorithms
G group
4 cases · 97 algorithms
W group
1 cases · 23 algorithms
H group
4 cases · 65 algorithms
Q group
4 cases · 89 algorithms
K group
4 cases · 91 algorithms
L group
10 cases · 235 algorithms
X group
10 cases · 206 algorithms