Speedsolving.com Wiki - User contributions [en]

OLLCP

2014-08-18T13:49:53Z

Risos15: Undo revision 24404 by Risos15 (talk)

{{Method Infobox
|name=OLLCP
|image=OLLCP.png
|proposers=Various
|year=
|anames=
|variants
|steps=1
|algs=~330
|moves=~11
|purpose=
* [[Speedsolving]]
}}

'''Orientation of Last Layer and Corner Permutation'''
'''OLLCP''' is an [[experimental method|experimental]] [[LL]] method which both [[OLL|orients the last layer]] and [[CLL|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 ==
* [[CxLL]]
* [[EPLL]]
* [[OLLCP-A]] The subset in which all corners are oriented.

== External links ==
* [https://docs.google.com/spreadsheet/ccc?key=0Aq2MYrmu606CdFFuallJVFRDQm9FUm44ekoxbDRwQVE#gid=0 Robert Yau's OLLCP]
* [https://sites.google.com/site/piauscubingsite/3x3x3/ollcp/others Antoine Piau's OLLCP (COLL and CLLEF on another page)]
* [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.

[[Category:Experimental methods]]
[[Category:3x3x3 last layer substeps]]

OLLCP

2014-08-18T13:49:34Z

Risos15: Undo revision 24403 by Risos15 (talk)

{{Method Infobox
|name=OLLCP
|image=OLLCP.png
|proposers=Various
|year=
|anames=
|variants
|steps=1
|algs=~330
|moves=~11
|purpose=
* [[Speedsolving]]
}}

'''Orientation of Last Layer and Corner Permutation'''
'''OLLCP''' is am [[experimental method|experimental]] [[LL]] method which both [[OLL|orients the last layer]] and [[CLL|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 ==
* [[CxLL]]
* [[EPLL]]
* [[OLLCP-A]] The subset in which all corners are oriented.

== External links ==
* [https://docs.google.com/spreadsheet/ccc?key=0Aq2MYrmu606CdFFuallJVFRDQm9FUm44ekoxbDRwQVE#gid=0 Robert Yau's OLLCP]
* [https://sites.google.com/site/piauscubingsite/3x3x3/ollcp/others Antoine Piau's OLLCP (COLL and CLLEF on another page)]
* [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.

[[Category:Experimental methods]]
[[Category:3x3x3 last layer substeps]]

OLLCP

2014-08-18T13:47:30Z

Risos15: Grammar again.

OLLCP

2014-08-18T13:47:08Z

Risos15: Grammar

{{Method Infobox
|name=OLLCP
|image=OLLCP.png
|proposers=Various
|year=
|anames=
|variants
|steps=1
|algs=~330
|moves=~11
|purpose=
* [[Speedsolving]]
}}

'''Orientation of Last Layer and Corner Permutation'''
'''OLLCP''' is am [[experimental method|experimental]] [[LL]] method which both [[OLL|orients the last layer]] and [[CLL|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 ==
* [[CxLL]]
* [[EPLL]]
* [[OLLCP-A]] The subset in which all corners are oriented.

== External links ==
* [https://docs.google.com/spreadsheet/ccc?key=0Aq2MYrmu606CdFFuallJVFRDQm9FUm44ekoxbDRwQVE#gid=0 Robert Yau's OLLCP]
* [https://sites.google.com/site/piauscubingsite/3x3x3/ollcp/others Antoine Piau's OLLCP (COLL and CLLEF on another page)]
* [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.

[[Category:Experimental methods]]
[[Category:3x3x3 last layer substeps]]