PLL Ub
U-PLL b, EPLL Ub
Optimum 9 moves
39 algorithms
First algorithm: (U) B2 U M U2 M' U B2
The beginner version of PLL: first place the last-layer corners (2 cases, a swap of adjacent or opposite corners), then its edges (4 cases, the EPLLs). Six cases instead of 21.
6 cases · 404 algorithms
Proven optimum for every case.
Definition of the set: Speedsolving wiki (PLL), Speedsolving wiki (EPLL).
U-PLL b, EPLL Ub
Optimum 9 moves
39 algorithms
First algorithm: (U) B2 U M U2 M' U B2
U-PLL a, EPLL Ua
Optimum 9 moves
37 algorithms
First algorithm: (U) B2 U' M U2 M' U' B2
H-PLL, X-PLL, EPLL H
Optimum 9 moves
51 algorithms
First algorithm: R2 S2 R2 U' R2 S2 R2
Z-PLL, EPLL Z
Optimum 12 moves
76 algorithms
First algorithm: (U2) M2 Uw M2 Uw' S' M2 S
Ab-PLL
Optimum 9 moves
116 algorithms
First algorithm: (U2) x Lw' B Lw' U2 Lw B' Lw' U2 Lw2
Y-PLL
Optimum 13 moves
85 algorithms
First algorithm: x' U2 B' Lw2 U Lw' B' Lw' B U Lw' U' Lw U
No case matches these filters.