Difference between revisions of "CPLS"

From Speedsolving.com Wiki
(Added raven's example solve and removed the outdated ones)
(35 intermediate revisions by 7 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=~10
 
|purpose=<sup></sup>
 
|purpose=<sup></sup>
 
* [[Speedsolving]]
 
* [[Speedsolving]]
* [[One-Handed_Solving]]
+
* [[One-Handed Solving]]
 
}}
 
}}
  
''CPLS'' (short for ''Corner Permutation and Last Slow'') is used namely when one has completed the cube apart from [[EPLL]], [[CPLL]], [[COLL]], and the last corner of the final F2L slot.
+
'''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).
''CPLS'' is intended to both finish the last F2L corner, usually the DFR corner, while permuting the last-layer corners.  This sets up the last layer to be able to be solve with a 2-gen system, either with one or two steps.
 
Although seemingly hard to recognize, this method can be very beneficial, especially for one-handed solvers with fast <R,U> or <L,U> -gen algs, depending on hand preference.
 
  
If one is to simply do a two-step process after reducing the [[LL]] to a 2-gen system, they would need only 11 algorithms - 7 for [[OCLL]], which in turn of course solves [[CLL]] entirely, and 4 for [[EPLL]], in that order.
+
Although seemingly hard to recognize, CPLS can be very beneficial, especially for [[one-handed]] solvers if fast 2-generator algorithms are used.
If they instead decide to learn a 1-step system, then [[2GLL]] is really the only choice.  When looking for this, be aware that it is also referred to as ZZ-d.  2GLL algorithms can be solved entirely with the use of only two faces, and is composed of 84 algorithms.
 
  
===Learning Approach===
+
== History ==
 +
CPLS was proposed by [[Baian Liu]] in 2009. The name initially only referred to the [[CPLC]] subset which solves the F2L corner + CP.
  
Like almost any other set of algorithms, it's best to divide ''CPLS'' into subsets.
+
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.
  
These subsets are the same ones that can be found in [[CLS]], which are -, +, O, I, Im, and C.  The first three sets have six algorithms each, while the next two have three each, and the final set has only two.
+
== Subsets ==
 +
Full CPLS is grouped into subsets depending on the F2L case they solve and then by their corner permutation.
  
Perhaps a good order to learn these sets in would be C, O, I, Im, -, +. This is recommended due to ease of learning and ease of recognizing.
+
=== 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.
  
===Recognition===
+
{|border="0" width="100%" valign="top" cellpadding="3"
 +
|-valign="top"
 +
|
  
Recognition is definitely the most prominent downfall to this method, at least in terms of personally finding an intuitive way to do so.
+
==== S ====
However, a system has been found that works very well.
+
[[File:CP_S.png]]
  
Before you start, it must be emphasized that you *must* know your color scheme fairly well.
+
Solved CP
 +
|
  
 +
==== D ====
 +
[[File:CP_D.png]]
  
Let's set up a case. Do x R' U R U' R' U R U' R' U R U' x' onto a scrambled cube with yellow on top and red on front.
+
Diagonal swap
 +
|
  
Seeing this, I know that this is an O case, and that it's already positioned correctly, in URF, to be recognized.
+
==== R ====
 +
[[File:CP_R.png]]
  
Next, I need to look at the remaining three U-layer pieces.
+
Adjacent swap on R
 +
|
  
Let's keep a system to *always* start with UFL.
+
==== B ====
 +
[[File:CP_B.png]]
  
Once reaching any of the three corners, in this order, the first goal is to locate the U-layer sticker, in my case yellow. This should be on the top for this case.
+
Adjacent swap on B
 +
|
  
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.
+
==== L ====
 +
[[File:CP_L.png]]
  
Following that, do the same for the LUB and BRU corners.
+
Adjacent swap on L
 +
|
  
For the L face, you should come out with green, since the sticker at LUB is green.
+
==== F ====
 +
[[File:CP_F.png]]
  
For the B face, you should come out with orange, since the sticker at BRU is orange.
+
Adjacent swap on F
 +
|}
  
One could write this case down as an [O BLF], being as though B is on F, L is on L, and F is on B.  Depending on initial AUF, however, this may change
+
=== 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]]:
  
So, from the above, we can visualize that F = red, L = green, and B = orange. 
+
{|border="0" width="100%" valign="top" cellpadding="3"
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! 
+
|-valign="top"
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'
 
 
After applying this, the [[F2L]] should be finished, and the [[LL]] should be reduced to a [[2GLL]] case, to be done in however many steps. More than two steps makes CPLS very unnecesarry and arguably a waste of time, though.
 
  
===Example Solves===
+
===== C =====
 +
[[File:F2L37.png]]
 +
|
  
The best way to describe this recognition technique is simply with an example solve, so three shall be presented here.
+
===== I =====
For convenience of most, a standard color scheme shall again be assumed here.  Also, please scramble with the standard white on top (U) and green on front (F).
+
[[File:F2L39.png]]
 +
|
  
 +
===== Im =====
 +
[[File:F2L40.png]]
 +
|
  
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'
+
===== - =====
 +
[[File:F2L33.png]]
 +
|
  
A Petrus approach:
+
===== + =====
 +
[[File:F2L34.png]]
 +
|
  
2x2x2: x2 D B' R' D2 L2 (5/5)
+
===== O =====
 +
[[File:F2L32.png]]
 +
|}
  
2x2x3: x' y D R D' U' L' U L (7/12) -note that this sets up for an Im case later on.
+
==== 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.
  
EO: y U M' U M (4/16)
+
== 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 [https://docs.google.com/spreadsheets/d/1ArN5Ya43kJH4KlQHBPye_vzyRLZh_NA8N0u5voZgAgw/ here].
  
F2L: x y U2 R' U' R U R' U' R2 U2 R' (10/26) [ewww]
+
== Example Solves ==
 +
The following [[ZZ-d]] solve by [[raven]] shows the method in action:
  
CPLS (Im FBL): y2 U R' F2 R D' L' U2 L' U' L2 D (11/37)
+
  Scramble: F' U R2 U' R2 U' B2 D2 B2 U R2 F2 L2 B L' D R2 B2 L2 U
 
+
 
2GLL (Pi Ua1): y (y) R U2 R2 U2 R U R2 U R2 U' R2 U2 R' U2 R(16/53)
+
  x2
 
+
  B' F' R F D R' B2 U' L2 U2 L2 U' L // XXEOCross
AUF: U2 (1/54)
+
  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
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'
 
 
 
A RH OH ZZ approach:
 
 
 
EOCross: L B' R' U D F R D R' D R' (11/11)
 
 
 
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) [gah, 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)
 
 
 
 
 
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
 
 
 
A CFOP approach:
 
 
 
Cross: x2 F D L2 U2 L F' (6/6)
 
 
 
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 ==
 
  
 +
== 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 16:28, 27 February 2021

CPLS
[[Image:]]
Information
Proposer(s): Baian Liu, ?, ?
Proposed: 2009?
Alt Names: none
Variants: none
Subgroup:
No. Algs:
Avg Moves: ~10
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