OLLCP

From Speedsolving.com Wiki
Revision as of 14:31, 25 February 2016 by Logiqx (talk | contribs) (→‎See also)

This page is about the OLLCP method substep. For the algs, see OLLCP (few algs).

OLLCP
OLLCP.png
Information
Proposer(s): Various
Proposed:
Alt Names: CLL+EO, CEOLL, OCPLL
Variants: CLLEF
Subgroup:
No. Algs: 331
Avg Moves: ~11
Purpose(s):


Orientation of Last Layer and Corner Permutation OLLCP is an experimental LL method which both orients the last layer and solves the corners. Thus after this step only EPLL remains. The price to get there however is a high algorithm count (300+). Only a very few number of people use the full set, but a number of people use the subsets COLL and CLLEF. Several people came up with the idea, some of them after they wanted to re-learn some OLL algorithms and noticed the new algorithms had a different effect on the corners. By 'recycling' the old OLL algorithms it is sometimes very easy and fast to be able to avoid an N perm and get higher chances of PLL-skips. Because some OLLCP algorithms are really slow and because of the high number of algorithms, it is advisable to only learn the nice and fast algorithms. A slow OLLCP plus a U perm is probably slower than a fast 'normal' OLL algorithm leaving any other PLL.

See also

  • OLLCP (few algs)
  • OLLCP-A. The subset in which all corners are oriented.
  • COLL. The subset in which all edges are oriented.
  • CLLEF. The subset in which all edges are not oriented.
  • CxLL. Various subsets which solve Corners of the Last Layer
  • EPLL. Edge Permutation of the Last Layer follows OLLCP

External links