Difference between revisions of "OLLCP"

From Speedsolving.com Wiki
m
m (na, wrong)
Line 14: Line 14:
  
 
'''Orientation of Last Layer and Corner Permutation'''
 
'''Orientation of Last Layer and Corner Permutation'''
'''OLLCP''' is a [[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+). Though full OLLCP is not known to be used, a number of people use the subsets [[COLL]] and [[CLLEF]] ([[PLL]] is also a subset).  
+
'''OLLCP''' is a [[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+). Though full OLLCP is not known to be used, a number of people use the subsets [[COLL]] and [[CLLEF]].  
  
 
== See also ==
 
== See also ==

Revision as of 09:25, 3 September 2010

OLLCP method
OLLCP.png
Information about the method
Proposer(s): Guus Razoux Schultz, Kenneth Gustavsson
Proposed:
Alt Names:
Variants: none
No. Steps: 1
No. Algs: ~330
Avg Moves: ~11
Purpose(s):


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.

See also

External links

  • SuneOLL Proposed system to solve all cases where the corners are already permuted