Cubemuch Français

PLL

Permutation of the last layer: the top face is done, one algorithm puts its pieces in place. 21 cases, each named by a letter.

21 cases · 1,101 algorithms

Proven optimum for every case.

Definition of the set: Speedsolving wiki (PLL).

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: yellow on top, blue in front, red on the right. Grey marks what the case does not look at.
  • Lengths in HTM: a face turn or a wide turn counts 1, a slice 2, a rotation 0. The "setup" (often a U turn) presents the cube 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.

PLL Aa

A-PLL a

Optimum 9 moves

47 algorithms

First algorithm: (U') Lw2 B2 Lw' U' Lw B2 Lw' U Lw'

PLL Ab

Ab-PLL

Optimum 9 moves

50 algorithms

First algorithm: Lw U' Lw B2 Lw' U Lw B2 Lw2

PLL E

E-PLL

Optimum 14 moves

67 algorithms

First algorithm: (U2) F R B R' F' R L F L' B' L F' R' L'

PLL F

F-PLL

Optimum 13 moves

76 algorithms

First algorithm: M' U2 L F' R U2 Rw' U Rw' R2 U2 R2

PLL Ga

G-PLL a

Optimum 12 moves

46 algorithms

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

PLL Gb

G-PLL b

Optimum 12 moves

43 algorithms

First algorithm: (U) R' U' R B2 D L' U L U' L D' B2

PLL Gc

G-PLL c

Optimum 12 moves

44 algorithms

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

PLL Gd

G-PLL d

Optimum 12 moves

44 algorithms

First algorithm: (U') L U L' B2 D' R U' R' U R' D B2

PLL H

H-PLL, X-PLL

Optimum 9 moves

51 algorithms

First algorithm: R2 S2 R2 U' R2 S2 R2

PLL Ja

J-PLL a, L-perm

Optimum 10 moves

52 algorithms

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

PLL Jb

J-PLL b

Optimum 10 moves

47 algorithms

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

PLL Na

N-PLL a

Optimum 13 moves

63 algorithms

First algorithm: R' U R2 B2 U R' B2 R U' B2 R2 U' R

PLL Nb

N-PLL b

Optimum 13 moves

56 algorithms

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

PLL Ra

R-PLL a

Optimum 13 moves

60 algorithms

First algorithm: B U' Rw U' Rw' B' Rw U Rw' U' B U2 B'

PLL Rb

R-PLL b

Optimum 13 moves

45 algorithms

First algorithm: B' U Lw' U Lw B Lw' U' Lw U B' U2 B

PLL T

T-PLL

Optimum 10 moves

34 algorithms

First algorithm: (U) z' U2 Lw U2 Lw' U2 x U2 Lw' U2 Lw U2

PLL Ua

U-PLL a

Optimum 9 moves

37 algorithms

First algorithm: (U) B2 U' M U2 M' U' B2

PLL Ub

U-PLL b

Optimum 9 moves

39 algorithms

First algorithm: (U) B2 U M U2 M' U B2

PLL V

V-PLL

Optimum 14 moves

60 algorithms

First algorithm: (U) B R B R' U R' U' R2 B' R' U' B' U B'

PLL Y

Y-PLL

Optimum 13 moves

64 algorithms

First algorithm: x' U2 B' Lw2 U Lw' B' Lw' B U Lw' U' Lw U

PLL Z

Z-PLL

Optimum 12 moves

76 algorithms

First algorithm: (U2) M2 Uw M2 Uw' S' M2 S

Algorithms