PLL
| ||||||||||||||||||||||
PLL is the acronym for Permutation of the Last Layer. Permutation of the Last Layer is the last step of many speedsolving methods. In this step, the pieces on the top layer have already been oriented (OLL) so that the top face has all the same color, and they can now be moved into their solved positions. There are 21 PLLs (13 if you count mirrors and inverses as being the same) and each one is named after a letter. The following page gives a list of all of the PLLs, along with a picture and a list of common algorithms for each one. The diagrams below are top views of where you want the pieces to go. For example, the T Permutation (or 'T perm') swaps the UL and UR edges, as well as the UFR and UBR corners. If you like, try out all of the available algorithms for a case to see which one feels the fastest to you - the same algorithm may not be the fastest for everyone, and shorter algorithms are not always faster than longer ones. PLL is a subgroup of ZBLL.
|
Note that all of these algorithms assume that you are right-hand dominant and know the Western notation, where a lowercase letter means a double-layer turn and rotations are denoted by x, y, and z. (how to add algorithms) Click on an algorithm (not the camera icon) to watch an animation of it. |
| Permutations of corners only |
|---|
| Permutations of edges only |
|---|
| Permutations of corners and edges |
|---|
Permutations of Edges Only
This subgroup, EPLL is used as a substep for many speedsolving methods, for example in the VH method (COLL).
H Permutation
|
Name: H-PLL, X-PLL |
Speedsolving Algorithms
| PLL | M2' U M2' U2 M2' U M2' |
| PLL | M2' U' M2' U2' M2' U' M2' |
| PLL | M2' U2 M2' U M2' U2 M2' |
| PLL | M2' U2 M2' U' M2' U' M2' |
Note that the last two algorithms should only be used as Post-AUF tricks, as it saves having to do a U or U' after the PLL if necessary.
Optimal Algorithms
| HTM 9 | R2 F2 B2 L2 D' R2 F2 B2 L2 |
| STM 7 | M2 D S2 D2 S2 D M2 |
| QTM 12 | R L U U R' L' F' B' U U F B |
| QSTM 12 | R L U U R' L' F' B' U U F B |
Ua Permutation
|
Name: U-PLL a |
Speedsolving Algorithms
| PLL | R U R' U R' U' R2 U' R' U R' U R |
| PLL | (U2) M2' U M U2 M' U M2' |
| PLL | (U2) R U' R U R U R U' R' U' R2 |
| PLL | (U) R2 U' S' U2' S U' R2 |
Optimal Algorithms
| HTM 9 | B2 U' R L' B2 R' L U' B2 |
| STM 7 | B2 U' M U2 M' U' B2 |
| QTM 12 | R U B U' B' R' L' B' U' B U L |
| QSTM 10 | R' F' M' F U F' M F U' R |
Ub Permutation
|
Name: U-PLL b |
Speedsolving Algorithms
| PLL | R' U R' U' R3 U' R' U R U R2 |
| PLL | (U2) M2 U' M U2 M' U' M2 |
| PLL | (U2) R2' U R U R' U' R3 U' R' U R' |
| PLL | (U) R2 U' S R2' S' R2 U R2' |
| PLL | (U) R2' U R2 S R2' S' U' R2 |
Optimal Algorithms
| HTM 9 | B2' U L' R B2' L R' U B2' |
| STM 7 | B2' U M U2' M' U B2' |
| QTM 12 | L' U' B' U B L R B U B' U' R' |
| QSTM 10 | L F M' F' U' F M F' U L' |
Z Permutation
|
Name: Z-PLL |
Speedsolving Algorithms
| PLL | (U) M' U M2' U M2' U M' U2 M2' |
| PLL | M2' U M2' U M' U2 M2' U2 M' |
| PLL | M2' U2 M U M2' U M2' U M |
| PLL | R' U' R U' R U R U' R' U R U R2 U' R' |
Optimal Algorithms
| HTM 12 | R L' U2 D2 R L' D' R2 L2 U F2 B2 |
| STM 7 | M S2 M' D' M2 D S2 |
| QTM 13 | R B' R' F B R' F B' R' B R F F |
| QSTM 10 | M S' S' M' D M' M' D' S' S' |
Permutations of Corners Only
This is also known as CPLL (Corner Permute Last Layer). There is one more case in this group, the X-PLL but that is the same alg as H-PLL + U2, see EPLL.
Aa Permutation
|
Name: A-PLL a |
Speedsolving Algorithms
| PLL | (U') x R' U R' D2 R U' R' D2 R2 x' |
| PLL | x' R2 D2 R' U' R D2 R' U R' x |
| PLL | (U2) x L2 D2' L' U' L D2' L' U L' x' |
| PLL | (U) R' D R U' R' D' R U' R' D R U2 R' D' R |
Optimal Algorithms
| HTM 9 | R2 F2 R' B' R F2 R' B R' |
| STM 9 | R2 F2 R' B' R F2 R' B R' |
| QTM 12 | R B' D F' D' B' D F D' B B R' |
| QSTM 12 | R B' D F' D' B' D F D' B B R' |
Ab Permutation
|
Name: Ab-PLL |
Speedsolving Algorithms
| PLL | (U') x R2' D2 R U R' D2 R U' R x' |
| PLL | x' R U' R D2 R' U R D2 R2' x |
| PLL | (U2) x L U' L D2' L' U L D2' L2' x' |
| PLL | (U) R' D R U2 R' D' R U R' D R U R' D' R |
| PLL | (U') R' U' D' R U R' D R U' R' U R |
Optimal Algorithms
| HTM 9 | (y) L2 F2 L B L' F2 L B' L |
| STM 9 | (y) L2 F2 L B L' F2 L B' L |
| QTM 12 | (y) L' B D' F D B D' F' D B' B' L |
| QSTM 12 | (y) L' B D' F D B D' F' D B' B' L |
E Permutation
|
Name: E-PLL |
Speedsolving Algorithms
| PLL | (U) x' R U' R' D R U R' D' R U R' D R U' R' D' x |
| PLL | R' D' R U' R' D R U R' D' R U2 R' D R U' R' D' R U R' D R |
| PLL | R2 U R' d' (R U R' U')2 R U R' F U' F2 |
| PLL | F' (r U R' U' r' F R) U2 (r U R' U' r' F R F') |
Optimal Algorithms
| HTM 14 | F R B R' F' R L F L' B' L F' R' L' |
| STM 14 | F R B R' F' R L F L' B' L F' R' L' |
| QTM 14 | F R B R' F' R L F L' B' L F' R' L' |
| QSTM 14 | F R B R' F' R L F L' B' L F' R' L' |
Permutations of Edges and Corners
F Permutation
Speedsolving Algorithms
| Alg | y L R2 U R U R2 U' R' U' R2 U' R U2 L' U R' |
| PLL | (y) R' U' F' (R U R' U') R' F R2 (U' R' U') R U R' U R |
| PLL | (y x) R' B' U' l U R' U' R' F R2 U' R' U' R U R' U R |
| PLL | y2 R' U2 R' d' R' F' R2 U' R' U R' F R U' F |
| Alg.1 | M' U2 L F' R U2 r' U r' R2 U2 R2 |
| Alg.1 | (R' U R U') R2 (F' U' F U) (R F R' F') R2 U' |
| Alg.1(v2) | (R' U R U')(R' l')(d' R' d B)(R U R' U')(R l) |
| Inv(Alg.1) | (y) R2 (F R F' R') (U' F' U F) R2 (U R' U' R) U |
| Alg.1(svn) | y2 R U' R' U R U F R U R' U' x' D' R2 D R D' |
| Alg.1(svn1) | y2 R U' R' U R U F R U R' U' x U' R2 U R U' |
| Alg.1(v2) | R' U R U' R2 (y') R' U' R U (y x) R U R' U' R2 (x') |
| Alg.2(v2) | (y2) R' U2 R' d' R' F' R2 U' R' U R' F R U' F |
| Alg.3(v2) | (y') F r2 R' U2 r U' r' U2 (x') R2 U' R' U r2 u' (z') |
| Alg.4 | B' U' R' B U B' U' B' R B2 U' B' U' B U B' U B |
| Alg.4(v2) | (y) R' U' F' R U R' U' R' F R2 U' R' U' R U R' U R |
| Alg.5 | L U' L' U L2 F U F' U' L' F' L F L2 U |
| Alg.5(v2) | (y2) R U' R' U R2 (y) R U R' U' (x) U' R' U R U2 (x') |
| Alg.5(v3) | (y' z) R U R' U' R U2 (z' y') R U R' U' (y' x') R' U' R U R2 (x) |
| Alg.9 | L F R' F' L' F' D2 B' L' B D2 F' R F2 |
| Alg | R' U2 R U' R' f' U' R U2 R' U' R U' R' f U' R |
Optimal Algorithms
| HTM 13 | (y) R2 B2 R2 L U' L F2 R' D L' F2 R L' |
| STM 12 | (y) R2 B2 R2 L U' L F2 R' D L' F2 M (x) |
| QTM 16 | (y) R R F R F' R' U' F' U F R R U R' U' R |
| QSTM 15 | R' F' U' S' R U R' S U' R' F R' B' R' B |
Ga Permutation
Speedsolving Algorithms
| PLL | (y) R2 U (R' U R' U') R U' R2 (D U' R' U) R D' |
| PLL | (y) R2' u (R' U R' U' R) u' R2 (y') R' U R |
| PLL | (y) R2 U (R' U R' U' R) U' R2 D (U' R' U R) D' |
| PLL | (y2) F2' D (R' U R' U' R) D' F2 L' U L |
| PLL | R L U2 R' L' (y') R' U L' U2 R U' L |
| PLL | R U2' R' U' F' R U R2 U' R' F R U R2 U2' R' |
| PLL | (R U R' U' R') U F (R U R U' R') F' U R' U2 R |
| PLL | (y2 z) U R U' R' U' R B U R U R' U' B' R U' R2 U (z' y2') |
| PLL | (y) L F2 R (F' L' F U) R' U' (F' L F' L') |
| PLL | (y) R2' S2 U l2' U' l2' u R2 U' r2' F2 |
Optimal Algorithms
| HTM 12 | (y) F B U2 F' B' L' U R' U2 L U' R |
| STM 11 | (y') L2 S2 D F2 D' F2 U F2 U' B2 R2 (z2) |
| QTM 14 | (y') L L D F' U F' U' F D' L L B' U B |
| QSTM 14 | (y') L L D F' U F' U' F D' L L B' U B |
Gb Permutation
Speedsolving Algorithms
| PLL | R' U' R U D' R2 U R' U R U' R U' R2 D |
| PLL | R' U' R (y) R2 u (R' U R U' R) u' R2 |
| PLL | (y) F' U' F R2 u (R' U R U' R) u' R2' |
| PLL | (y2) R' U2 R U' F R U R' U' R' F' U' R U R U' R' (y2') |
| PLL | R' U' R B2 D (L' U L U' L) D' B2 |
| PLL | (y2) L' U' L (y') R2' u (R' U R U' R) u' R2 |
| PLL | (y') R' U L' U2 R U' L (y) R L U2 L' R' |
| PLL | R2 D L2 D F2 L D R' D2 L D' R' U2 |
Optimal Algorithms
| HTM 12 | (y) R2 F2 U R2 D' R2 D B2 U' F2 B2 R2 |
| STM 11 | (y) R2 F2 U R2 D' R2 D B2 U' S2 L2 (z2) |
| QTM 14 | R' U' R B B D L' U L U' L D' B B |
| QSTM 14 | R' U' R B B D L' U L U' L D' B B |
Gc Permutation
Speedsolving Algorithms
| PLL | (y) R2 U' R U' R U R' U R2 D' U R U' R' D |
| PLL | (y') R2 F2 R U2 R U2 R' F R U R' U' R' F R2 |
| PLL | (y) R2' u' (R U' R U R') u R2 (y) R U' R' |
| PLL | (y) R2' u' (R U' R U R') u R2 B U' B' |
| PLL | (y) R2' U' (R U' R U R') U R2 (D' U R U' R' D) |
| PLL | (y) R2' D' F U' F U F' D R2 B U' B' |
| PLL | (y2) F2' D' L U' L U L' D F2 R U' R' |
| PLL | L' U' L U L U' F' L' U' L' U L F U' L U2 L' |
| PLL | (y2) R' U' R U R U' B' R' U' R' U R B U' R U2 R' (y2') |
| PLL | (z) U' R' U R U R' F' U' R' U' R U F R' U R2 U' (z') |
| PLL | L' R' U2 L R (y) L U' R U2 L' U R' |
| PLL | B2 L2 U' B2 D B2 D' R2 U M2 F2 (x2) |
| PLL | (y') R2' F2 R U2 R U2 R' F R U R' U' R' F R2 |
| PLL | (y') l' U2' L' U l F' U' L U F R' F R |
| PLL | (y) U F2 R2 L2 U' L2 U L2 D' L2 D R2 F2 U' |
| PLL | (y') (z) U2 (r' U R' U R U' r) U2 F R' F' (z') (y) |
Optimal Algorithms
| HTM 12 | B2 R2 L2 U' R2 U R2 D' R2 D L2 B2 |
| STM 11 | B2 M2 D' R2 D R2 U' R2 U L2 F2 (x2) |
| QTM 14 | F' L L B' L F L' U' B U L F' L F |
| QSTM 14 | F' L L B' L F L' U' B U L F' L F |
Gd Permutation
Speedsolving Algorithms
| PLL | (y2) R U R' U' D R2 U' R U' R' U R' U R2 D' |
| PLL | (y2) D' R U R' U' D R2 U' R U' R' U R' U R2 |
| PLL | (y2) R U R' (y') R2 u' (R U' R' U R') u R2 |
| PLL | (y2) R U R' F2 D' (L U' L' U L') D F2 |
| PLL | (y2) L U2 L' U F' (L' U' L U L) F U (L' U' L' U L) |
| PLL | R U2' R' U B' R' U' R U R B U R' U' R' U R |
| PLL | (y2 z) U R2' U' R F' U' R' U R U F R U' R' U' R U (z' y2') |
| PLL | (y2) l2 U' L2 U' F2 L' U' R U2 L' U l (x') |
| PLL | (y) L U' R U2 L' U R' (y) R' L' U2 R L |
| PLL | (y) f R f' R2 u' R U' R' U R' u R2 |
| PLL | (y') R' F' R F' U' L' U F R' F' L F2 R |
| PLL | (y') R2' F' (R U R U') (R' F' R) (U2' R' U2' R') F2 R2 |
| PLL | (y z) U2 B' U R U R' U' B' U R2' U' R2 U' B2 U2' (z' y') |
| PLL | (y2) (R U R') F2 D' L U' L' U L' D F2 U2 |
| PLL | (y2) (F U' R' F) (R2 U' R' U') (R U R' F') U2 (R U R' F') U' F (U R U' R') F' |
Optimal Algorithms
| HTM 12 | L U L' B2 D' R U' R' U R' D B2 |
| STM 11 | B2 L2 U' B2 D B2 D' R2 U M2 F2 (x2) |
| QTM 14 | F' L' F L' U' B' U L F' L' B L L F |
| QSTM 14 | F' L' F L' U' B' U L F' L' B L L F |
Ja Permutation
|
Name: J-PLL a, L-perm |
Speedsolving Algorithms
| Alg.1(v3) | (y2) x R2' F R F' R U2 r' U r U2 x' |
| Alg.7 | (y2) L U' R' U L' U2 R U' R' U2 R |
| PLL | U R U R' U' R' F R2 U' R' U2 R U R' F' R U R' U' R' F R F' |
| PLL | (y) U R' U' R B R' U' R U l U' R2' F R (x) |
| PLL | (y2) (F U' R' F) (R2 U' R' U') (R U R' F')2 |
| PLL | (y2) (F R U' R')2 (U R U R2') (F' R U F') |
| Alg.7(v2) | (y2) R' U2 R U R' U2' L U' R U L' |
| Alg.3 | L' U R' U2 L U' R U L' U R' U2 L U' R |
| Alg.1(v4) | y2 R' U2 R U R' U2 L U' R U L' |
| Alg.1(v2) | (y) (R' U L') U2 (R U' R') U2 R L |
| Alg.2 | (y2) F U' R U' R' U' R U R' F' R U R' U' R' F R U F' |
| Alg.2 | B2 R' U' R B2 L' D L' D' L2 |
| Alg.2(v2) | (y2) F2 L' U' L F2 R' D R' D' R2 |
| Alg.2(v3) | (y2) F2 L' U' L b2 L' U L' U' r2 |
| Alg.7(v3) | (y2) R' U2 R U R' (z) R2' U R' D R U' (z') |
| Alg.7(v4) | (y2) R' U2' R U R' (z) R2 U R' D R U' (z') |
| Alg.7(v5) | (z) D R' U' R D' R (R U R' U') R2 U (z') |
| Alg.7(v6):Inv(Alg.7) | R U' L' U R' U2 L U' L' U2' L |
| Alg.8 | R' L' U2 L U L' U2 R U' L U |
| Alg.9 | L' U2 L U L' U2 R U' L U R' |
| Alg.10 | R' d' R U R' U F U F' U' R U2 R' U F U |
| Alg.11 | (y2) (M' D2 M') R U R' F' R U R' U' R' F R2 U' R' (M D2 M) |
| Alg.12 | L' U' L F L' U' L U L F' L2 U L U |
| Alg.13 | (y2) (R' U L' U2 R U' L) U (R' U L' U2 R U' L) |
Optimal Algorithms
| HTM 10 | L2 D L D' L B2 R' U R B2 |
| STM 10 | L2 D L D' L B2 R' U R B2 |
| QTM 12 | (y) F' B' U U B U B' U U F U' B |
| QSTM 12 | (y) F' B' U U B U B' U U F U' B |
Jb Permutation
Speedsolving Algorithms
| (y2) R' U L U' R U2' L' U L U2 L' |
| Alg.4 | R U R' F' R U R' U' R' F R2 U' R' U' |
| Alg.1 | R U2 R' U' R U2 L' U R' U' r x |
| Alg.2 | R U2 (R' U' R) U2 L' (U R' U') L |
| Alg.1(v3) | (y) (R U' L) U2 (R' U R) U2 L' R' |
| Alg.1(v4) | L' U R U' L U2 R' U R U2 R' |
| Alg.2 | B2 (L U L') B2 (R D' R D) R2 |
| Alg.2(v2) | (y2) F2 (R U R') F2 (L D' L D) L2 |
| Alg.2(v3) | (y2) F2 (R U R') b2 (R U' R U) l2' |
| Alg.2(v4) | (y' x') L2 u L u' L2 (x' y) (L U' L U) r2 |
| Alg.2(v5) | (y2 x) U2 l U l' U2 r (U' L U) r2 |
| Alg.3 | R U' L U2 R' U L' U' R U' L U2 R' U L' |
| Alg.6 | B2 U D' B2 U B2 U' B2 D B2 U' B2 U |
| Alg.6(v2) | (y') L2 (U D') L2 U L2 U' L2 D L2 U' L2 |
| Alg.8 | R U R' F' R U R' U' l' U l2 F' l' U' |
Decomposition(Alg.6) = [D' B2: [B2, D] (U) [B2, U] ] [B2, U']
| Alg.7 | R U2 R' U' R U2 L' U R' U' L |
| Alg.13 | R2 U F U F' R2 F U' F' R2 U' R2 U' |
Optimal Algorithms
| HTM 10 | R2 D' R' D R' B2 L U' L' B2 |
| STM 10 | R2 D' R' D R' B2 L U' L' B2 |
| QTM 12 | (y') F B U' U' B' U' B U' U' F' U B' |
| QSTM 12 | (y') F B U' U' B' U' B U' U' F' U B' |
Na Permutation
|
Name: N-PLL a |
Speedsolving Algorithms
| PLL | (r' D r U2)5 |
| PLL | (r' D' r U2)5 |
| PLL | (l' D l U2)5 |
| PLL | (l' D' l U2)5 |
| PLL | R U R' U R U R' F' R U R' U' R' F R2 U' R' U2 R U' R' |
| PLL | F' R U R' U' R' F R2 F U' R' U' R U F' R' |
| PLL | R F U' R' U R U F' R2 F' R U R U' R' F |
| PLL | (z) U' F R F' R' F' U F2' U R' F' R' F R U' F' (z') |
| PLL | (z) B' U R U' R' U' B U2' B R' U' R' U R B' U' (z') |
| PLL | (L U' R U2 L' U R')2 U' |
| PLL | (z) (U R' D R2 U' R D')2 (z') |
| PLL | L' U L2 F2 U L' F2 L U' F2 L2 U' L |
| Alg.1(v3) | (y z) R' (U R' D R2 U' R D')2 (z') |
| Alg.1(v4) | (R U' L U2 R' U L')2 |
| Alg.1(v5) | (z) (D R' U R2 D' R U')2 (z') |
| Alg.1(v6) | (z) U R' D R2 U' R U (z') R' U' R (z) R2 U' R (z') R' |
| Alg.1(v7) | R U' L d2 L' U L R' U' R U2 r' F l' |
Optimal Algorithms
| HTM 13 | R' U R2 B2 U R' B2 R U' B2 R2 U' R |
| STM 13 | R' U R2 B2 U R' B2 R U' B2 R2 U' R |
| QTM 16 | R B R' L' D' R B R' D L U' B U B' U' B' |
| QSTM 15 | F U' B U U F' U S' L' B L L F' L B' (z) |
Nb Permutation
|
Name: N-PLL b |
Speedsolving Algorithms
| PLL | (r D r' U2)5 |
| PLL | (r D' r' U2)5 |
| PLL | (l D l' U2)5 |
| PLL | (l D' l' U2)5 |
| PLL | R' (U r' F2 R F') M' (U r' F2 R F') r U |
| PLL | (R' U R U') R' F' U' F (R U R' F) (R' F' R U') R |
| PLL | (R' U R U') R' F' U' F (R U R' U') (R U' f R f') |
| PLL | (R' U L' U2 R U' L)2 U |
| PLL | (z) (D' R U' R2' D R' U)2 (z') |
| PLL | B R' U' R U R B' R2' B' U R U R' U' B R |
| PLL | (x') U R' F' R F R U' R2' U' F R F R' F' U R (x) |
| PLL | R' B' U R U' R' U' B R2 B R' U' R' U R B' |
| PLL | (x') R' U' F R F' R' F' U R2' U R' F' R' F R U' (x) |
| PLL | (z) U' F' (R U R' U' R' F) U2' F (U' R' U' R U F') (z') |
| PLL | (z) B' U' R B R' B' R' U B2' U B' R' B' R B U' (z') |
| PLL | (z) F U' R' U R U F' U2 F' R U R U' R' F U (z') |
| PLL | z D' R U' R2 D R' U D' R U' R2 D R' U z' |
| PLL | (z) (U' R D' R2' U R' D)2 (z') |
| PLL | z U' R D' R2 U R' D U' R D' R2 U R' D z' |
| PLL | (z) U' R2 U (R U R' F' R U R' U' R' F R2 U' R' ) U2 R2 U z' |
| PLL | L' U R' d2 R U' L R' U L' U2 l F' r |
| PLL | r' D' F r U' r' F' D r2 U r' U' r' F r F' |
| PLL | R2 D R' U R D' R2 U' R U' R' U' F R U R' U' R' F' R |
| PLL | R U' R2 F2 U' R F2 R' U F2 R2 U R' |
Optimal Algorithms
| HTM 13 | L U' L2' B2' U' L B2' L' U B2' L2' U L' |
| STM 13 | L U' L2' B2' U' L B2' L' U B2' L2' U L' |
| QTM 16 | L' B' L R D L' B' L D' R' U B' U' B U B |
| QSTM 15 | F' U B' U' U' F U' S R B' R' R' F R' B (z') |
Ra Permutation
Speedsolving Algorithms
| PLL | (y') R U' R' U' R U R D R' U' R D' R' U2 R' |
| PLL | (y') R U R' F' R U2 R' U2 R' F R U R U2 R' U' |
| PLL | R U2 R' U2 R B' R' U' R U R B R2 U |
| PLL | R U2 R' U2 R B' R' U' R U l U R2 (x) |
| PLL | (y2 z) U R2 U' R2 U F' U' R' U R U F U2 (z') |
| PLL | (y2) L U2 L' U2 L F' L' U' L U L F L2 |
| PLL | (y') R2 B' R' U' R' U R B R' U2 R U2 R' |
| PLL | (y) L2 F' L' U' L' U L F L' U2 L U2 L' |
| PLL | F2 R' F' U' F' U F R F' U2 F U2 F' |
| PLL | (y' x') R2 U' l' U' R' U l U l' U2 R U2 R' |
| PLL | (y') R l U' l' U' R' U l U l' U2 R U2' R' |
| PLL | F2 L2 U F U F' U' F' U' L2 F' U F' U' |
| PLL | R U' R F2 U R U R U' R' U' F2 R2 U |
| PLL | (y') R2 F2 U R U R' U' R' U' F2 R' U R' |
| PLL | (y') R U R' F' R U2 R' U2 R' F R U R U2 R' U' |
| PLL | R U2 R' U' R' F' R U2 R U2 R' F R U' R' U |
Optimal Algorithms
| HTM 13 | (y) F U2 F' U R B' R' F R B R' U F' |
| STM 12 | (y) F U2 S R B' D' F R2 F2 R' F D (z') |
| QTM 14 | (y') F U U F' U R B' R' F R B R' U F' |
| QSTM 13 | (y') F U B' D B U B' D' S R F R F' (z') |
Rb Permutation
Speedsolving Algorithms
| PLL | R' U2 R U2 R' F (R U R' U') R' F' R2' U' |
| PLL | (y') L' U' L F L' U2 L U2 L F' L' U' L' U2 L U |
| PLL | R' U2 R U2 R' F (R U R' U') l' U' R2 (x') |
| PLL | (z') U' L2 U L2 U' F U L U' L' U' F' U2 (z) |
| PLL | R' U2 R U2 R' F R U R' U' R' F' R2 |
| PLL | R' U2 R' D' R U' R' D R U R U' R' U' R |
| PLL | y' R U2 R' U2 R' F R2 U' R' U' R U R' F' R U R' U R U2 R' |
| PLL | y R2 F R U R U' R' F' R U2 R' U2 R |
| PLL | (y x) R2 U l U R U' l' U' l U2 R' U2 R |
| PLL | (y') r' L' U r U L U' r' U' r U2 L' U2 L |
| PLL | (y') L' U' L F L' U2 L U2 L F' L' U' L' U2 L U |
| PLL | (y2) L' U2 L U L F L' U2 L' U2 L F' L' U L U' |
Optimal Algorithms
| HTM 13 | (y) R2 F R U R U' R' F' R U2 R' U2 R |
| STM 12 | (y) R2 F2 R F2 U R U2 L' U' M' B2 R (x') |
| QTM 14 | (y) R' U R U R' L D' L' U L D L' U R |
| QSTM 13 | (y) R' U R U M' F' L' B L F L' B R (x') |
T Permutation
|
Name: T-PLL |
Speedsolving Algorithms
| PLL | R U R' U' R' F R2 U' R' U' R U R' F' |
| PLL | F R U' R' U R U R2 F' R U R U' R' |
| PLL | R U R' U' R' F R2 U' R' U F' L' U L |
| PLL | R2 U R2 U' R2 U' D R2 U' R2 U R2 D' |
| PLL | (y2) L' U' L U L F' L2 U L U L' U' L F |
Optimal Algorithms
| HTM 10 | (y) F2 U' F2 D R2 B2 U B2 D' R2 |
| STM 10 | (y) F2 U' F2 D R2 B2 U B2 D' R2 |
| QTM 14 | (y) F' U' F B' R' U R F' U F R' U' R B |
| QSTM 13 | (y) F' U' S' U' L U F' L F U' L' U B (z) |
V Permutation
Speedsolving Algorithms
| PLL | (y) R U' R U R' D R D' R U' D R2 U R2 D' R2 |
| PLL | (y) R' U R' U' R D' R' D R3 U D' R2 U' R2' D R2 |
| PLL | R' U R U' R' f' U' (R U2 R' U' R U' R') f R |
| PLL | R' f' (R U R' U R U2 R') U f (R U R' U') R |
| PLL | R' U R' U' B' R' B2 U' B' U B' R B R |
| PLL | R' U R' d' R' F' R2 U' R' U R' F R F |
| PLL | R' U R' U' (y) R' F' R2 U' R' U R' F R F |
| PLL | (y2 z) U' R U' R' F' U' F2 l' U' l F' U F U (z' y2') |
| PLL | (y2 x) R U R U' B U' B' U2' R' U' B' R' B R' (x' y2') |
| PLL | R' U R' U' B' l' (x2' y') U2 R' U' R (y) U' R U R (x) |
| PLL | (z) D' R2 D R2 U R' D' R U' R U R' D R U' |
| PLL | R U2 R' D R U' R U' R U R2 D R' U' R D2 |
| PLL | R' U R' U' R D' R' D R' U D' R2 U' R2 D R2 |
| PLL | (y') F' U F' U' R' F' R2 U' R' U R' F R F |
| PLL | R2' D' R2 U R2' U' D R D' R D R' U R U' R |
| PLL | x' (R' F R F') U (R U2 R' U') (R U' R' U2) (R U R' U') |
Optimal Algorithms
| HTM 14 | R' U R' U' B' D B' D' B2 R' B' R B R |
| STM 14 | R' U R' U' B' D B' D' B2 R' B' R B R |
| QTM 15 | R' U R' U' B' D B' D' B B R' B' R B R |
| QSTM 15 | R' U R' U' B' D B' D' B B R' B' R B R |
Y Permutation
Speedsolving Algorithms
| PLL | R' U' R U' L R U2 R' U' R U2 L' U R2 U R |
| PLL | F R U' R' U' R U R' F' (R U R' U') (R' F R F') |
| PLL | R2 U' R' U R U' x D' R' U R' U' R' D R |
| PLL | F R' F R2 U' R' U' R U R' F' R U R' U' F' |
| PLL | R' U' R F2 R' U R d R2 U' R2' U' R2 |
| PLL | R2 U' R2 U' R2 U R' F' R U R2 U' R' F R |
| PLL | R2 U' R2 U' R2 d R U R' B2 R U' R' |
| PLL | R2 U' R2 U' R2 U y' R U R' B2 R U' R' |
| PLL | F2 D R2 U R2 D' R' U' R F2 R' U R |
| PLL | (y') R2 u R2' U R2 D' R' U' R F2' R' U R |
| PLL | (R U R' U') (R' F R F') (R U R' U') R' F (R2 U' R' U) (R U R' F') |
| PLL | R2' U' R2 U' R2' U R2 D' R2' U R2 U' R2' D R2 |
Optimal Algorithms
| HTM 13 | R2 U' R2 U' R2 U F U F' R2 F U' F' |
| STM 13 | R2 U' R2 U' R2 U F U F' R2 F U' F' |
| QTM 15 | R R U' R R FR' B' D' R D F' R' B R |
| QSTM 15 | R R U' R R FR' B' D' R D F' R' B R |
External links
- 2-Look PLL
- PLL Algorithm Database
- 2-Sided PLL Recognition
- AlgDB PLL Page
- SpeedCubeDB PLL Page
- "PLL 2SR: A guide to recognizing PLLs by looking at only two sides (V2.0)" (Comparative pattern analysis of PLLs from all angles, by Parity Case)
- of PLL algorithms executions
- Recognize PLLs by patterns (PLL patterns and Algs by RiDo)
- PLL Cheat Sheet (Printable PDF of all PLL algorithms on a single page)
- Speedsolving.com: Recognizing PLLs from only 2 sides
- Recognizing PLLs from only 2 sides - Improved version
- YouTube series
- speedcubingtips.eu PLL algs
- Speedcubedb PLL List
- CubeRoot PLL Algs






















