OPLL

OPLL method Information about the method Proposer(s): MLSTRM Proposed: 2011 Alt Names: Lazy ZBLL, MOPLL Variants: none No. Steps: 1 No. Algs: 21 (PLLalgs) Avg Moves: 14.3 HTM Purpose(s): Speedsolving

OPLL, also known as lazy ZBLL is a subset of the ZBLL last layer mathod. If you have a Headlights of Bowtie OLL case, then most of the time, it can be solved by a conjugate of a PLL, so no new need to be learned algorithms, if you know PLL already (Conjugate is [A B A']).

Please note that because not everyone uses the same PLL's, the first listed case may not work for you. Because of this, the PLL is listed inside the brackets, feel free to subsitute it.

See Also

• My partial OPLL method
• OPLL cases V2
• OPLL cases V1

OPLL algorithms

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.

Bowtie Cases

A-perms

Name: B(A-f) Used in: ZBLL,OPLL Optimal moves: (Aa+2)HTM {{{text}}}

Name: B(B-f) Used in: ZBLL,OPLL Optimal moves: (Ab+2)HTM {{{text}}}

G-perms

Name: B(Gb-f) Used in: ZBLL,OPLL Optimal moves: (Gb+2)HTM {{{text}}}

Name: B(Gd-f) Used in: ZBLL,OPLL Optimal moves: (Gd+2)HTM {{{text}}}

J-Perms

Name: B(L-b) Used in: ZBLL,OPLL Optimal moves: (Ja+2)HTM {{{text}}}

Name: B(L-l) Used in: ZBLL,OPLL Optimal moves: (Ja+2)HTM {{{text}}}

Name: B(J-b) Used in: ZBLL,OPLL Optimal moves: (Jb+2)HTM {{{text}}}

Name: B(J-r) Used in: ZBLL,OPLL Optimal moves: (Jb+2)HTM {{{text}}}

R-Perms

[[File:]]

Name: B(R-r) Used in: ZBLL,OPLL Optimal moves: (Ra+2)HTM {{{text}}}

[[File:]]

Name: B(R-l) Used in: ZBLL,OPLL Optimal moves: (Rb+2)HTM {{{text}}}

T-Perms

[[File:]]

Name: B(T-f) Used in: ZBLL, OPLL Optimal moves: (T+2)HTM {{{text}}}

OPLL

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

[[File:]]

Name: B(T-b) Used in: ZBLL, OPLL Optimal moves: (T+2)HTM {{{text}}}

OPLL

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