Sie sind auf Seite 1von 3

Edited by Foxit Reader Copyright(C) by Foxit Corporation,2005-2009 For Evaluation Only.

PERMUTATION OF LAST LAYER (PLL)


Please Note: There are total 21 algorithms of which some you are already aware of by now. These algorithms help in reducing the process of Edge Permutation and Corner Permutation steps in solving the Last Layer in one single step known as Permutation of Last Layer (PLL). Hence, the steps involved in solving the Last Layer are: 1. Edge Orientation 2. Corner Orientation (7 algorithms sent earlier) 3. PLL The main difficulty in using PLL while solving cube is the recognition of the case in-front of you. Hence, efforts have been made to show you how to recognize these cases. There is no short-cut in memorizing the algorithms though; you have to work on that yourself. Follow the lines for recognition !

4 Cases where only EDGES have to be permuted!

Red Line Pieces are in correct position Blue Line Pieces are for observation

U(b)

U(a)

(R2(R U) U) (R U) (R' U') (R' U') (R' (R' U R') (R U') (R U) (R U') U' R2)

(R2 U) (R U) (R' U') (R' (R' U (R U ) (R U) (R U) (R U)U') (R U R2 ) R')

(M2 U M2) U2 (M2 U M2) (OR) R2 U2 R U2 R2 U2 R2 U2 R U2 R2

(R' U' R U') (R U R U') (R' U R U) R2 (U' R') U2 (OR) y M2 U M2 U M U2 M2 U2 M U2

3 Cases where only CORNERS have to be permuted! Color a Observations (colors) 1: b = c Color b 2. c = a A(a) Color c
X (R U R) D2 (R U R) D2 (R2) X

here, 1. b=c 2. c!=a

A(b)
X (R2) D2 (R U R) D2 (R U R) X

According to the condition s holding good apply the algorithm!

E
X (R UR) D (R U R) D2 (L U L) D (L U L) X

RCHG2010, IIT Kanpur

Note: Top view is given follow the usual convention !

10 Cases where 2 Corners & 2 Edges have to be permuted!


Are Different Colors ! V
(Similar Algorithms) [R' U R' U'] y (R' F') (R2 U' R' U) (R' F R F) [R' U2 R' U'] y (R' F') (R2 U' R' U) (R' F R UF)

Y
F (R U' R' U') (R U R' F') (R U R' U') (R' F R F')

J(a)
(R U L) U2 (R U R) U2 (R L U)

T
(Similar Algorithms) (R U R' U') (R' F R2) (U' R' U') (R U R' F')

J(b)

(R U R' F') (R U R' U') (R' F R2) (U' R' U')

R (a)
(Similar Algorithms) (L U2 L U2) (L F) (L U L U) (L F L2) U'

R(b)

(R' U2 R U2) (R' F) (R U R' U') (R' F' R2) U'

N(b)
(Similar Algorithms) *(R U L) U2 (R U L)] * 2
(Or)

N(a)

*(L U R) U2 (L U R)+ * 2
(Or)

(R' U R U') (R' F' U') (F R U) (R' F R' F') (R U' R) U2

(R U' R' U) (l U) (F U' R' F') (R U' R U) (l' U R') U2

RCHG2010, IIT Kanpur

4 Cases where 3 Corners & 3 Edges have to be permuted!


(Algorithms in this section may look difficult but with simple observation of the movement of the pieces you can remember them)

G(d)

(R U R) y (R2 u) (R U R U) (R u R2)

G(c)

(R2 u') (R U' R U) (R' u R2) (f R' f')

G(b)

(R U R) y (R2 u) (R U R U) (R u R2)

G(a)

(R2 u) (R U R U) (R u R2) y (R U R)

RCHG2010, IIT Kanpur

Das könnte Ihnen auch gefallen