PLL algorithms (permute last layer)
last modified: 27feb2006
|
# |
Permutation Case |
Algorithm |
|
1 |
|
(R2 D') U2 (L R') F2 (L' R)
D R2 |
|
2 |
|
(R2 D') (R' L) F2 (L' R) U2 D R2 |
|
3 |
|
(R2 B2) (R F R') B2 (R
F' R) |
|
4 |
|
(R' F R') B2 (R F' R')
(B2 R2) |
|
5 |
|
(R B') (R' B) (F R' F) B' (R' B R) (F2 U) R U R' U R' U' R' U R
U' R' U' R2' U R
|
|
6 |
|
(R' U) (R U' R2) (F' U' F U) x (R U R' U' R l U') |
|
7 |
|
(R U R' U') (R' F) (R2 U') (R' U' R U R' F') |
|
8 |
|
(R U2') (R' U) y x' (R U') (R' D) (R U l' U) y' (R' U) |
|
9 |
|
(R' U2) (R U2') (R' F) (R U R' U') (R' F' R2 U') |
|
10 |
|
B2 (R' U' R) B2 x (r' U L' U' L2) (speedsolving) [y2] (L' U) (R U' L) U2 (R' U R U2 R') (blindsolving) |
|
11 |
|
B2 (L U L') B2 x (l U' R U R2) (speedsolving) (L' U) (R U' L) U2 (R' U R U2 R') (blindsolving) |
|
12 |
|
(R U') (L d2) (L' U L) (R' U' R U2) (L' U R' U') |
|
13 |
|
(L' U) (R' U2' L U' L') (R U R') (U2' L U' R U) |
|
14 |
|
(R' U R' U') x2 y' (R' U R' U') (l R U') (R' U R U) |
|
15 |
|
F (R U') (R' U' R U R' F') (R U R' U') (l' U l F') |
|
16 |
|
(l U' R' D) (R U R') u2 (R' U R) D (R' U' R) |
|
17 |
|
(R2 B2) F2 L2 D' (R2 B2) F2 L2 U (M2 U) (M2 U2) (M2 U) (M2) |
|
18 |
|
(R2' u) (R' U R' U' R u' R2) y' (R' U R) |
|
19 |
|
(R2 u' R U') (R U) (R' u) (l2' y' x2') (R U' R') |
|
20 |
|
(R U R') y' (R2 u' R U') (R' U R') (u R2) |
|
21 |
|
(L' U' L) y' (R2' u) (R' U) (R U') (R u') R2 |
