Difference between revisions of "CPLS"

From Speedsolving.com Wiki
m (corrected cpls movecount)
(26 intermediate revisions by 6 users not shown)
Line 1: Line 1:
{{Method Infobox
+
{{Substep Infobox
 
|name=CPLS
 
|name=CPLS
 
|image=
 
|image=
 
|proposers=[[Baian Liu]], ?, ?
 
|proposers=[[Baian Liu]], ?, ?
 
|year=2009?
 
|year=2009?
|steps=1
+
|subgroup=
|algs=26
+
|algs=
|moves=~10
+
|moves=9.1
 
|purpose=<sup></sup>
 
|purpose=<sup></sup>
 
* [[Speedsolving]]
 
* [[Speedsolving]]
Line 12: Line 12:
 
}}
 
}}
  
'''CPLS''' (short for '''Corner Permutation and Last Slot''') is a substep used to solve the final F2L corner (usually DFR) and permute the last-layer corners while preserving the corresponding edge and [[EOLL]]. If used when only the last F2L corner, [[EPLL]], [[CPLL]], and [[COLL]] remain, CPLS leaves just [[EPLL]] and [[COLL]], which may be solved using [[2-generator]]. Although seemingly hard to recognize, CPLS can be very beneficial, especially for [[one-handed]] solvers if fast 2-generator algorithms are used.
+
'''CPLS''' (short for '''Corner Permutation and Last Slot''') is a substep used to solve the last F2L slot (usually FR) and [[CP|permute the last layer corners]] while preserving [[EO]]. [[CPLS]] leaves the solver with a [[2-gen]] last layer, which may be solved in one look using [[2GLL]] (84 algs) or in two using [[OCLL]]+[[EPLL]] (11 algs).
  
A two-step solution to [[EPLL]] and [[COLL]] requires only 11 algorithms: 7 for [[OCLL]], which leaves 4 [[EPLL]] cases. One-step solution, known as [[2GLL]], has 84 cases. Note that this is also referred to as [[ZZ-d]].
+
Although seemingly hard to recognize, CPLS can be very beneficial, especially for [[one-handed]] solvers if fast 2-generator algorithms are used.
  
 
== History ==
 
== History ==
CPLS was proposed by [[Baian Liu]] in 2009. (who else?)
+
CPLS was proposed by [[Baian Liu]] in 2009. The name initially only referred to the [[CPLC]] subset which solves the F2L corner + CP.
  
== Learning Approach ==
+
However, CPLS here refers to solving the last F2L ''pair'' + CP because the LS suffix in cubing often indicates the last pair being solved (compare [[ZBLS]],[[OLS]], [[VLS]], [[WVLS]] etc.) and thus prevents confusion for people unfamiliar with CPLS. If one wants to clearly distinguish between the "original CPLS" and the "new CPLS", they can be referred to as CPLC and Full CPLS, respectively.
CPLS is naturally divided into the subsets - +, O, I, Im, and C, the same classification used for [[CLS]]. The first three sets have 6 algorithms each, the next two have 3 each, and the final set has only 2. One recommended order, for ease of learning and recognition, is C, O, I, Im, -, +.
 
  
== Recognition ==
+
== Subsets ==
One possible disadvantage of CPLS is its seemingly difficult recognition. The following system, however, works well. First, position the last slot to URF.
+
Full CPLS is grouped into subsets depending on the F2L case they solve and then by their corner permutation.
 +
 
 +
=== Naming by CP case ===
 +
Below, only the subsets for the individual F2L cases are listed. The naming for the different CPs of each F2L case is obtained by adding the following F2L letters to the subset, depending on the CP of the U layer corners.
 +
 
 +
{|border="0" width="100%" valign="top" cellpadding="3"
 +
|-valign="top"
 +
|
 +
 
 +
==== S ====
 +
[[File:CP_S.png]]
 +
 
 +
Solved CP
 +
|
 +
 
 +
==== D ====
 +
[[File:CP_D.png]]
 +
 
 +
Diagonal swap
 +
|
 +
 
 +
==== R ====
 +
[[File:CP_R.png]]
 +
 
 +
Adjacent swap on R
 +
|
  
'''Scramble:''' x R' U R U' R' U R U' R' U R U' x' (yellow on top, red on front).
+
==== B ====
 +
[[File:CP_B.png]]
  
This is an O case. Look at the remaining three U-layer pieces. Let's keep a system to *always* start with UFL.
+
Adjacent swap on B
 +
|
  
Once reaching any of the three corners, in this order, the first goal is to locate the U-layer (yellow) sticker: on top in this case.
+
==== L ====
 +
[[File:CP_L.png]]
  
Next, look at the sticker *clockwise* from this sticker. In other words, the sticker on the F face, or the FLU sticker.  This should be red. I note this, and that my red FACE is currently on B.  I now pretend that the entire F face is orange, because when rotated, that sticker lies on that face.
+
Adjacent swap on L
 +
|
  
Repeat for LUB and BRU. For the L face, you should come out with green, since the sticker at LUB is green. For the B face, you should come out with orange, since the sticker at BRU is orange.
+
==== F ====
 +
[[File:CP_F.png]]
  
This case may be written [O BLF], meaning B is on F, L on L, and F on B. This notation, however, depends on the initial [[AUF]].
+
Adjacent swap on F
 +
|}
  
From the above, we can visualize that F = red, L = green, and B = orange. Knowing that yellow is our U-layer sticker, we know that the above can't be right - those colors aren't allowed to be like that! So what we must do is switch those "face." To do this, we must switch the corners that these pieces are represented by. For example, the UFL piece represents the Front face. In this case, we must switch the UFL and UBR corners.  To understand what to do now, we go over to https://sites.google.com/site/devastatingspeed/3x3x3/cpls and try to find the right case. Knowing that we have a diagonal switch (switching UFL and UBR has essentially the same effect as switching UFR and UBL), we look for the O case with the diagonal swap, which is in the 3rd row, second column, yielding us the algorithm x (U R' U' R)*3 x'
+
=== Naming by F2L case ===
 +
==== CPLC ====
 +
CPLC, the "original CPLS", stands for Corner Permutation Last Corner and solves the last LL corner and CP. It consists of 26 algorithms and is grouped into the following six subsets depending on the F2L corner, which is the same classification that is used for [[CLS]]:
  
== Example Solves ==
+
{|border="0" width="100%" valign="top" cellpadding="3"
This recognition method is best illustrated with example solves. Standard color scheme is assumed throughout. Scramble with white on top (U) and green in front (F). Notes in square brackets by [[Stachu Korick]].
+
|-valign="top"
 +
|
  
'''Scramble 1:''' D' B' D2 F2 R F' L' R B L' F' U' R' B F2 U R2 D L2 D2 U' B R' F2 D'
+
===== C =====
 +
[[File:F2L37.png]]
 +
|
  
A Petrus approach
+
===== I =====
2x2x2: x2 D B' R' D2 L2 (5/5)
+
[[File:F2L39.png]]
2x2x3: x' y D R D' U' L' U L (7/12) [Tthis sets up for an Im case later on]
+
|
EO: y U M' U M (4/16)
 
F2L: x y U2 R' U' R U R' U' R2 U2 R' (10/26) [ewww]
 
CPLS (Im FBL): y2 U R' F2 R D' L' U2 L' U' L2 D (11/37)
 
2GLL (Pi Ua1): y (y) R U2 R2 U2 R U R2 U R2 U' R2 U2 R' U2 R(16/53)
 
AUF: U2 (1/54)
 
  
 +
===== Im =====
 +
[[File:F2L40.png]]
 +
|
  
'''Scramble 2:''' L2 F' L2 F L' D B D2 U2 L2 D L' R B' L2 U B2 R2 D2 R B2 D U2 B' F'
+
===== - =====
 +
[[File:F2L33.png]]
 +
|
  
A RH OH ZZ approach
+
===== + =====
EOCross: L B' R' U D F R D R' D R' (11/11)
+
[[File:F2L34.png]]
BL slot: U2 R U R' L U L' (7/18)
+
|
FL slot: L2 U2 L U L' U L2 (7/25)
 
BR slot: U R' U' R U' R' U R (8/33)
 
FR edge: R U R' (3/36) [It kills me not to do CLS for this case :(]
 
CPLS setup: U2 (1/37)
 
CPLS (O): y U2 z' U L' D2 L U' L' D2 z (8/45)
 
2GLL (T Ub2): z' U L2 U' L' U L' U' L U L U' L U L2 U' (15/60)
 
AUF: L2 (1/61, or 57 with cancellations)
 
  
 +
===== O =====
 +
[[File:F2L32.png]]
 +
|}
  
'''Scramble 3:''' L' R' B F U B2 D2 F2 L F2 D U' B' U D2 F2 B L2 R2 B U2 B' D2 U2 R
+
==== CPLE ====
 +
[[File:F2L25.png]]
 +
CPLE stands for Corner Permutation Last Edge and solves the last F2L edge and CP. It only covers F2L case 25 and consists of only 6 algorithms.
  
A CFOP approach
+
== Recognition ==
Cross: x2 F D L2 U2 L F' (6/6)
+
The different CPLS cases can be recognized by putting the F2L corner into one position and then comparing the stickers of the corners which can be seen. This system uses the relationships same, opposite and adjacent, which is similar to standard [[CxLL]] recognition. A more in-depth guide for this recognition can be found [https://docs.google.com/spreadsheets/d/1ArN5Ya43kJH4KlQHBPye_vzyRLZh_NA8N0u5voZgAgw/ here].
BL slot: F' U2 F L U' L' (6/12)
 
FR slot: U R U2 R' U R' F R F' (9/21)
 
BR slot: U' R' U2 R2 B R B' (7/28)
 
ELS setup: y U (1/29)
 
ELS: R U' R' F' U2 F (6/35)
 
CPLS (+): U' U' y R' U L' U' R U L (9/44)
 
2GLL (Pi Ub3): y' (y) R U2 R2 U' R' U R U' R' U' R' U' R' U2 R U2 (15/59, or 56 with cancellations)
 
  
== See Also ==
+
== Example Solves ==
 +
The following [[ZZ-d]] solve by [[raven]] shows the method in action:
 +
 
 +
  Scramble: F' U R2 U' R2 U' B2 D2 B2 U R2 F2 L2 B L' D R2 B2 L2 U
 +
 
 +
  x2
 +
  B' F' R F D R' B2 U' L2 U2 L2 U' L // XXEOCross
 +
  U' L U L' // F2L-1
 +
  U' D R' U2 R U' R' U' R D' // CPLS
 +
  U R' U' R U R U2 R' U' R' U R U' R U' R' U2 // 2GLL
 +
 
 +
== See also ==
 
* [[2GLL]]
 
* [[2GLL]]
* [[CLS]]
+
* [[2-gen]]
 
* [[ZZ-d]]
 
* [[ZZ-d]]
* [[ELS]]
+
* [[One-Handed Solving]]
* [[One-Handed_Solving]]
+
* [[Advanced F2L]]
  
== External Links ==
+
== External links ==
 +
* [https://docs.google.com/spreadsheets/d/1ArN5Ya43kJH4KlQHBPye_vzyRLZh_NA8N0u5voZgAgw Full CPLS + Recognition sheet]
 
* [https://sites.google.com/site/devastatingspeed/3x3x3/cpls Baian Liu's Original site]
 
* [https://sites.google.com/site/devastatingspeed/3x3x3/cpls Baian Liu's Original site]
 
* [http://www.speedsolving.com/forum/showthread.php?p=454801#post454801 SpeedSolving CPLS+2GLL thread]
 
* [http://www.speedsolving.com/forum/showthread.php?p=454801#post454801 SpeedSolving CPLS+2GLL thread]
 
* [http://db.tt/KIRzYvL Stachu Korick's printable OH algs]
 
* [http://db.tt/KIRzYvL Stachu Korick's printable OH algs]
  
[[Category:Methods]]
+
[[Category:Experimental methods]]
[[Category:Advanced Methods]]
+
[[Category:Acronyms]]
[[Category:Experimental Methods]]
+
[[Category:3x3x3 last slot substeps]]
[[Category:Cubing Terminology]]
 
[[Category:Abbreviations and Acronyms]]
 
[[Category:Sub Steps]]
 

Revision as of 03:17, 13 August 2022

CPLS
[[Image:]]
Information
Proposer(s): Baian Liu, ?, ?
Proposed: 2009?
Alt Names: none
Variants: none
Subgroup:
No. Algs:
Avg Moves: 9.1
Purpose(s):


CPLS (short for Corner Permutation and Last Slot) is a substep used to solve the last F2L slot (usually FR) and permute the last layer corners while preserving EO. CPLS leaves the solver with a 2-gen last layer, which may be solved in one look using 2GLL (84 algs) or in two using OCLL+EPLL (11 algs).

Although seemingly hard to recognize, CPLS can be very beneficial, especially for one-handed solvers if fast 2-generator algorithms are used.

History

CPLS was proposed by Baian Liu in 2009. The name initially only referred to the CPLC subset which solves the F2L corner + CP.

However, CPLS here refers to solving the last F2L pair + CP because the LS suffix in cubing often indicates the last pair being solved (compare ZBLS,OLS, VLS, WVLS etc.) and thus prevents confusion for people unfamiliar with CPLS. If one wants to clearly distinguish between the "original CPLS" and the "new CPLS", they can be referred to as CPLC and Full CPLS, respectively.

Subsets

Full CPLS is grouped into subsets depending on the F2L case they solve and then by their corner permutation.

Naming by CP case

Below, only the subsets for the individual F2L cases are listed. The naming for the different CPs of each F2L case is obtained by adding the following F2L letters to the subset, depending on the CP of the U layer corners.

S

CP S.png

Solved CP

D

CP D.png

Diagonal swap

R

CP R.png

Adjacent swap on R

B

CP B.png

Adjacent swap on B

L

CP L.png

Adjacent swap on L

F

CP F.png

Adjacent swap on F

Naming by F2L case

CPLC

CPLC, the "original CPLS", stands for Corner Permutation Last Corner and solves the last LL corner and CP. It consists of 26 algorithms and is grouped into the following six subsets depending on the F2L corner, which is the same classification that is used for CLS:

C

F2L37.png

I

F2L39.png

Im

F2L40.png

-

F2L33.png

+

F2L34.png

O

F2L32.png

CPLE

F2L25.png CPLE stands for Corner Permutation Last Edge and solves the last F2L edge and CP. It only covers F2L case 25 and consists of only 6 algorithms.

Recognition

The different CPLS cases can be recognized by putting the F2L corner into one position and then comparing the stickers of the corners which can be seen. This system uses the relationships same, opposite and adjacent, which is similar to standard CxLL recognition. A more in-depth guide for this recognition can be found here.

Example Solves

The following ZZ-d solve by raven shows the method in action:

 Scramble: F' U R2 U' R2 U' B2 D2 B2 U R2 F2 L2 B L' D R2 B2 L2 U
 
 x2
 B' F' R F D R' B2 U' L2 U2 L2 U' L // XXEOCross
 U' L U L' // F2L-1
 U' D R' U2 R U' R' U' R D' // CPLS
 U R' U' R U R U2 R' U' R' U R U' R U' R' U2 // 2GLL

See also

External links