One-Handed PLL Algorithms: Algorithm Presentation Format

This document provides one-handed PLL algorithms in 3 sentences or less: 1) It presents one-handed algorithms to solve the various PLL cases, noting the algorithm format and recommended learning order. 2) The algorithms are grouped by permutation type (edges only, corners only, swapping corners) and include the case name and probability. 3) Examples of algorithms are provided for each permutation type using trigonometric moves and brackets to denote face turns.

Uploaded by

Fakhri Rafif

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (1 vote)

328 views2 pages

One-Handed PLL Algorithms: Algorithm Presentation Format

Uploaded by

Fakhri Rafif

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 2

One-Handed PLL Algorithms

Developed by Feliks Zemdegs

and Andy Klise

Algorithm Presentation Format

Round brackets are used to segment algorithms to

Suggested algorithm here assist memorisation and group move triggers.
Alternative algorithms here
Moves in square brackets at the end of algorithms
PLL Case Name - Probability = 1/x
denote a U face adjustment necessary to complete
the cube from the states specified.

It is recommended to learn the algorithms in the

order presented.

Permutations of Edges Only

z (U' R U' R') (U' R' U' R) U R U2' (R U' R U) R U (R U' R' U') R2
y2 z U2’ R U (R U' R' U') (R' U' R U') y2 (R2 U' R' U') R U R U (R U' R)
Ub - Probability = 1/18 Ua - Probability = 1/18

y (R' U' R U') (R U R U') (R' U R U) R2 U' R' [U2] R2 U2' R U2' R2 U2' R2 U2' R U2' R2
Z - Probability = 1/36 H - Probability = 1/72

Permutations of Corners Only

x (R' U R') D2 (R U' R') D2 R2 x' x R2' D2 (R U R') D2 (R U' R) x'

x' U2' R2 (U' L' U) R2 (U' L U') x x' z (R U' R) z’ R2 (U' L U) R2 U2' x
Aa - Probability = 1/18 Ab - Probability = 1/18

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

x' (R U' R' D) (R U R' D') (R U R' D) (R U' R' D') x
E - Probability = 1/36
Swap One Set of Adjacent Corners

(R U' R' U') (R U R D) (R' U' R D') (R' U2' R') [U'] (R' U2' R' D') (R U' R' D) (R U R U') (R' U' R) [U']
(R U R' F') (R U2' R' U2') (R' F R U) (R U2' R') [U'] (R' U2' R U2') R' F (R U R' U') R' F' R2 [U']
Ra - Probability = 1/18 Rb - Probability = 1/18

(R' U L' U2) (R U' R' U2' R) L [U']

R U2' R' U' R U2' L' U R' U' L
y' z (U' R2 U R U' R2) z' (R U' L U R')
Jb - Probability = 1/18
Ja - Probability = 1/18

y' (R U R' U') (R' U R U2') L' (R' U R U') L (U' R U' R')
(R U R' U') (R' F R2 U') R' U' (R U R' F')
(R' U' F') (R U R' U') (R' F R2 U') (R' U' R U) (R' U R)
T - Probability = 1/18
F - Probability = 1/18

Swap One Set of Diagonal Corners

(R' U R U') x' (U R U2' R') (U' R U' R') U2' (R U R' U') F (R U' R' U') (R U R' F') (R U R' U') (R' F R F')
(R' U2' R U2') L U' R' z R U' R U R' D R U' y' (R U R2 U) L' U2 R U' R' U2' L (R U' R U' R')
V - Probability = 1/18 Y - Probability = 1/18

(L U' R U2' L' U R') (L U' R U2' L' U R') [U'] (R' U L' U2 R U' L) (R' U L' U2 R U' L) [U]
(R U' L U2' R' U L') (R U' L U2' R' U L') [U'] (L' U R' U2 L U' R) (L' U R' U2 L U' R) [U]
Na - Probability = 1/72 Nb - Probability = 1/72

G Permutations (Double cycles)

R2 U (R' U R' U') (R U' R2) D U' (R' U R D') [U] y' (R' U' R U) D' (R2 U R' U) (R U' R U') R2 D [U']
R2 u (R' U R' U') R u' R2 z (U' R U) y' (R' U' R) y (R2 u R' U) (R U' R u') R2
Ga - Probability = 1/18 Gb - Probability = 1/18

R2 U' (R U' R U) (R' U R2 D') (U R U' R') D [U'] D' (R U R' U') D (R2 U' R U') (R' U R' U) R2 [U]
(R U R') y' (R2 u' R U') (R' U R' u) R2
Gc - Probability = 1/18 Gd - Probability = 1/18