Difference between revisions of "OLLCP"
Line 24: | Line 24: | ||
* [http://www.speedsolving.com/forum/showthread.php?t=23222 SuneOLL] Proposed system to solve all cases where the corners are already permuted | * [http://www.speedsolving.com/forum/showthread.php?t=23222 SuneOLL] Proposed system to solve all cases where the corners are already permuted | ||
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP (hax)] List of all cases. | * [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP (hax)] List of all cases. | ||
+ | * [https://sites.google.com/site/piauscubingsite/3x3x3/ollcp/others List of all OLLCP (COLL and CLLEF on an other page)] | ||
[[Category:Methods]] | [[Category:Methods]] |
Revision as of 22:17, 21 December 2011
|
Orientation of Last Layer and Corner Permutation
OLLCP is a 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+). Though full OLLCP is not known to be used, 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
External links
- SuneOLL Proposed system to solve all cases where the corners are already permuted
- OLLCP (hax) List of all cases.
- List of all OLLCP (COLL and CLLEF on an other page)