Speedsolving.com Wiki - User contributions [en]

Petrus-W

2020-02-13T14:00:14Z

ProStar:

{{Method Infobox
|name=Petrus-W
|image=PetrusW.png
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners while preserving EO using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* [[EO]] is more free than in [[Petrus Method|Petrus]]
* [[L2P]] has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like in [[Petrus Method|Petrus]], you cannot look into [[EO]] during inspection time
* [[L5EP]] has slightly more algorithms than [[EPLL]]
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look

==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit?usp=sharing/ L5EP Algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

CML-Method

2020-02-12T13:59:12Z

ProStar:

{{Method Infobox
|name=CML Method
|image=
|proposers=Various, [[Marc Waterman]], Christoph Petsch, Tobias Petsch
|year=2020
|variants=[[Waterman Method]],[[Salvia Method]]
|subgroup=EML,PML
|algs=20-40
|moves=max. 60
|purpose=Speedsolving
}}

The CML-Method (Corner-Middle-Layer-Method) is a speedsolving method created in 2020. It's predecessor was the [[Waterman Method]], but CML uses far less algorithms and is effitiently enough to be a speedcubing method.

'''CML-Method in-depth'''
----

* Step 1: First Layer (Blockbuilding or LBL approach)
* Step 2: COCP-LL (Corner Orientation Corner Permutation Last Layer) (done on the last layer)
* Step 3: EML (Edge-Middle-Layer)
* Step 4: PML (Permutation-Middle-Layer)

'''EML'''
----
turn the solved side on the back and insert the remaining edges of the last Layer with U-Perms and F-Moves to insert them, use also S moves or do f moves for better move speed. Sometimes the edges are misoriented (bad egdes in this sense). For these bad edges do: ''' z' 2(M U M U) z '''. You can also correctly insert the edge directly by choosing one of the U-Perms.

'''PML'''
----
Permutation of the Middle layer is done by a set of 6 algorithms.
Only bad edges at the right position: '''R E' R B2 R' E R E B2 R2 E' '''

One bad edge and three have to be permuted. Hold the bad edge on the front left position and do for
clockwise: ''' U' F L F2 B U R' F' R F2 B' L' U F' '''
counterclockwise: ''' U F U' L F2 B R' F R U' F2 B' L' F' ''' sometimes you have to do then:
'''U2 R B' D R' B U2 D2 F' L D' F L' D2''' ( for diagonal orientation of the edges on the Middle layer)

in case of no bad edge, hold the right permuted edge also on the front left side and do:
clockwise: U R2 U' D B2 D'
counterclockwise: U' D B2 U D' R2

the last case is a swap of two parallel edges:
'''U2 R U' D F L2 D2 R2 B U' D R U2 B2'''

'''Pros'''
----
* nearly no cube rotations needed
* very fast blockbuilding in step 1
* step 3 can be optimized by some more specific algorithms
* can be used as a beginner speedcubing method
* not much algorithms 20 - 40 (if optimized)
* sub-20 is possible

'''Cons'''
----
* E-moves are not ergonomic
* can be slow on some cases
* a lot of practice is needed to be really fast with this method

CML

2020-02-10T19:10:30Z

ProStar: Redirected page to CML-Method

#REDIRECT [[CML-Method]]

CML

2020-02-10T19:09:32Z

ProStar: ProStar moved page CMT-Method to CML: Two pages for the same method

The CML-Method (Corner-Middle-Layer-Method) is a speedsolving method created in 2020. It's predecessor was the [[Waterman Method]], but CML uses far less algorithms and is effitiently enough to be a speedcubing method.

'''CML-Method in-depth'''
----

Step 1: First Layer (Blockbuilding or LBL approach)
Step 2: COCP-LL (Corner Orientation Corner Permutation Last Layer) (done on the last layer)
Step 3: EML (Edge-Middle-Layer)
Step 4: PML (Permutation-Middle-Layer)

'''EML'''
----
turn the solved side on the back and insert the remaining edges of the last Layer with U-Perms and F-Moves to insert them, use also S moves or do f moves for better move speed. Sometimes the edges are misoriented (bad egdes in this sense). For these bad edges do: ''' z' 2(M U M U) z '''

'''PML'''
----
Permutation of the Middle layer is done by a set of 6 algorithms.
Only bad edges at the right position: '''R E' R B2 R' E R E B2 R2 E' '''

One bad edge and three have to be permuted. Hold the bad edge on the front left position and do for
clockwise: ''' U' F L F2 B U R' F' R F2 B' L' U F' '''
counterclockwise: ''' U F U' L F2 B R' F R U' F2 B' L' F' ''' sometimes you have to do then:
'''U2 R B' D R' B U2 D2 F' L D' F L' D2''' ( for diagonal orientation of the edges on the Middle layer)

in case of no bad edge, hold the right permuted edge also on the front left side and do:
clockwise: U R2 U' D B2 D'
counterclockwise: U' D B2 U D' R2

the last case is a swap of two parallel edges:
'''U2 R U' D F L2 D2 R2 B U' D R U2 B2'''

'''Pros'''
----
* nearly no cube rotations needed
* very fast blockbuilding in step 1
* step 3 can be optimized by some more specific algorithms
* can be used as a beginner speedcubing method
* not much algorithms 20 - 40 (if optimized)
* sub-20 is possible

'''Cons'''
----
* E-moves are not ergonomic
* can be slow on some cases
* a lot of practice is needed to be really fast with this method

Petrus-W

2020-02-10T18:40:20Z

ProStar:

{{Method Infobox
|name=Petrus-W
|image=PetrusW.png
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners while preserving EO using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* EO is more free than in [[Petrus Method|Petrus]]
* L2P has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like in [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* [[L5EP]] has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look

==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit?usp=sharing/ L5EP Algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

File:PetrusW.png

2020-02-10T18:40:01Z

ProStar: Petrus-W photo

== Summary ==
Petrus-W photo

L5EP

2020-02-10T02:24:27Z

ProStar:

{{Substep Infobox
|name=L5EP
|image=L5EP.png
|proposers=Unknown
|year=Unknown
|anames=[[Last five edges]]
|variants=[[EPLL]]
|subgroup=
|algs=16
|moves= ~7.37 STM
|purpose=
* [[Speedsolving]]
}}

'''Last 5 Edges Permute''', often abbreviated '''L5EP''', is a [[3x3x3|3x3]] subset that solves the 4 U-layer edges and the down-front edge simultaneously while preserving all other pieces.

The five affected edges must be correctly oriented for L5EP to work. L5EP is often used in methods like [[Petrus-W]] and [[Portico]], when there are only five edges left to solve on the cube.

There are 16 algorithms for L5EP, 10 excluding mirrors and 7 excluding mirrors and [[EPLL]].

Any case can be simplified to an [[EPLL]] by moving the DF edge into the front and inserting it with M' U2 M. Intuitive L5EP can be used, but it is recommended to learn algorithmic L5EP due to the faster execution and low number of algorithms.

==See Also==
* [[EPLL]]
* [[L5E]]
* [[Petrus-W]]
* [[Portico]]
* [[PCMS]]

==External Links==

* [https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit?usp=sharing L5EP Algorithms] - Includes mirrors and EPLL

File:L5EP.png

2020-02-09T21:34:08Z

ProStar: ProStar uploaded a new version of File:L5EP.png

== Summary ==
L5EP Image

Skis method

2020-02-09T21:27:25Z

ProStar:

{{Method Infobox
|name=Skis
|image=Skis_method.png
|proposers=WoowyBaby
|year=2019
|anames
|variants
|steps=4
|algs=9-42
|moves=<50
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}

The Skis method was proposed by [[WoowyBaby]] in 2019 as a speedsolving method. It could be described as a mix of [[Corners First]] and [[Roux]] and was developed to allow for high [[TPS]] while maintaining a low movecount and keeping [[blockbuilding]] to a minimum. In spite of its potential, it currently doesn't have any active users.

== Steps ==
'''Skis:''' Two 1x1x3 blocks ("skis") are built in DL and DR, respectively. Centers can be ignored here.

'''CLL:''' The remaining four corners on the top are oriented and permuted in one of 42 algorithms while preserving the DL and DR edges. Most [[CLL]] algorithms for 2x2 apply here, although one might also use [[CMLL]] (or any other [[CxLL]] subset that doesn't destroy DL and DR).

'''LR:''' The four edges in the E-slice are solved in pairs. (Similar to 4b of [[Roux]].)

'''LSE:''' The last six edges on the M-slice and the U-layer are solved <MU>-gen, usually in multiple steps. Roux LSE is most common, although different approaches (listed in [[LSE]]) can be used here as well.

== Pros ==
* '''Inspection:''' Due to the Skis step, most of the solve can be planned in inspection. Therefore, it is sometimes possible to plan up to CLL. This prevents pauses mid-solve due to recognition (which is considered one of the biggest problems in Roux).

* '''High TPS:''' Except for LR, every other step is either planned in inspection or algorithmic, which allows for very high TPS.

* '''Less blockbuilding than Roux:''' Compared to Roux, the Skis method needs comparable or even less blockbuilding at the beginning and none in the middle of the solve. Therefore, less blockbuilding skills and intuitivity are required. This also gives beginners an easier learning curve than [[Roux]] does.

* '''Algorithms:''' Only 42 algorithms need to be learned, which is the same as [[Roux]] and less than in other popular speedsolving methods like [[CFOP]]. Since only the DL and DR edges need to be preserved, most of the very well developed 2x2 [[CLL]] algorithms transfer here.

* '''Very ergonomic:''' The Skis step and CLL are mostly <RUF>-gen and LSE is completely <MU>-gen, so turn speed can be very high and there are no rotations.

== Cons ==
* '''LR:''' LR can be harder to learn as it is very intuitive and edges can be almost everywhere. This causes worse lookahead and low TPS. It also doesn't have great ergonomics, so one needs to be able to switch between R, U, F, M and E moves.

* '''Slice moves:''' Because of LR and LSE, this method heavily relies on slice moves, especially M, which can be hard for beginners to get used to and also aren't very easy to execute on [[big cubes]]. Since LSE is performed at the end of the solve, there is a higher chance to get a [[DNF]] instead of a [[+2]].

* '''Very new:''' As the Skis method is very recent, it hasn't been developed as much as other big speedsolving methods like [[CFOP]], [[Roux]] and [[ZZ]] and thus has a lot less resources.

== Possible improvements ==
* '''E2L:''' To improve LR, [[LMCF]]'s algorithmic E2L step can be used to allow for better ergonomics and higher tps because of the pre-made algorithms, although this will highly increase the amount of algorithms that need to be learned.

== See also ==
* [[WoowyBaby]]
* [[Corners First]]
* [[Roux]]
* [[CxLL]]
* [[LSE]]
* [[LMCF]]

== External links ==
* [https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-254#post-1317365 Original proposal with example solves]
* YouTube: [https://www.youtube.com/watch?v=v5fwjWhyzZ8 Video walkthrough]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

L5EP

2020-02-09T00:54:54Z

ProStar:

{{Substep Infobox
|name=L5EP
|image=L5EP.png
|proposers=Unknown
|year=Unknown
|anames=[[Last five edges]]
|variants=[[EPLL]]
|subgroup=
|algs=16
|moves= ~7.37 STM
}}

'''Last 5 Edges Permute''', often abbreviated '''L5EP''', is a [[3x3x3|3x3]] subset that solves the 4 U-layer edges and the down-front edge simultaneously while preserving all other pieces.

The five affected edges must be correctly oriented for L5EP to work. L5EP is often used in methods like [[Petrus-W]] and [[Portico]], when there are only five edges left to solve on the cube.

There are 16 algorithms for L5EP, 10 excluding mirrors and 7 excluding mirrors and [[EPLL]].

Any case can be simplified to an [[EPLL]] by moving the DF edge into the front and inserting it with M' U2 M. Intuitive L5EP can be used, but it is recommended to learn algorithmic L5EP due to the faster execution and low number of algorithms.

==See Also==
* [[EPLL]]
* [[L5E]]
* [[Petrus-W]]
* [[Portico]]
* [[PCMS]]

==External Links==

* [https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit?usp=sharing L5EP Algorithms] - Includes mirrors and EPLL

File:L5EP.png

2020-02-09T00:54:33Z

ProStar: L5EP Image

== Summary ==
L5EP Image

L5EP

2020-02-09T00:50:08Z

ProStar: Created page with "{{Substep Infobox |name=L5EP |image= |proposers=Unknown |year=Unknown |anames=Last five edges |variants=EPLL |subgroup= |algs=16 |moves= ~7.37 STM }} '''Last 5 Edges..."

{{Substep Infobox
|name=L5EP
|image=
|proposers=Unknown
|year=Unknown
|anames=[[Last five edges]]
|variants=[[EPLL]]
|subgroup=
|algs=16
|moves= ~7.37 STM
}}

'''Last 5 Edges Permute''', often abbreviated '''L5EP''', is a [[3x3x3|3x3]] subset that solves the 4 U-layer edges and the down-front edge simultaneously while preserving all other pieces.

The five affected edges must be correctly oriented for L5EP to work. L5EP is often used in methods like [[Petrus-W]] and [[Portico]], when there are only five edges left to solve on the cube.

There are 16 algorithms for L5EP, 10 excluding mirrors and 7 excluding mirrors and [[EPLL]].

Any case can be simplified to an [[EPLL]] by moving the DF edge into the front and inserting it with M' U2 M. Intuitive L5EP can be used, but it is recommended to learn algorithmic L5EP due to the faster execution and low number of algorithms.

==See Also==
* [[EPLL]]
* [[L5E]]
* [[Petrus-W]]
* [[Portico]]
* [[PCMS]]

==External Links==

* [https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit?usp=sharing L5EP Algorithms] - Includes mirrors and EPLL

L5E

2020-02-09T00:34:59Z

ProStar: /* See also */

{{Substep Infobox
|name=L5E
|image=
|proposers=
|year=
|anames=[[Last five edges]]
|variants=[[Sexy*+S(8355)]]n [[SexyM Beginner]], [[Commutators (pseudo EF)]]
|subgroup=
|algs= Unknown for 1 look, 5 for L5EO and 16 for L5EP
|moves= about 14
|purpose=
|previous=[[5 Corners Missing cube state]]
|next=[[Solved cube state]]
}}

'''L5E, Last five edges''', is an experimental method that solves five [[edges]], the four in U and one in the D layer, preserving all other pieces.

[[ELL]] is a sub group of L5E, all ELL's may be solved in two steps using this method.

== Description ==
There are two main sub-parts. First the edges are oriented using M'UM like in Roux; there are 5 cases for this, and the worst case in Roux (6 edges) is impossible. Then the edges must be permuted; you can place FD during orientation or right after using [U] M' U2 M (named 'P') and end with [[EPLL]], or just permute all five edges in one step.

L5E can be useful for [[Corners First]] if the E-slice, centres and three FL edges are solved after the corners. It is also useful in any method that starts with [[columns]], such as one which does the F2L pairs first and then finishes with [[CxLL|CMLL]], it is an alternative to the last step of [[Roux]] if the centres are placed together with the BD edge at first, also for any LBL style, cross minus one edge at first and then the LL corners have been finished with [[CLL]] or [[CMLL]] or the same for Fridrich with 2-look [[OLL]], corners first, then L5E orientation, place FD using P if it was not solved and end it all in PLL as usally.

==Intermediate system==

===Intuitive===
This style is not completely intuitive, because it is still necessary to know [[EPLL]]. First orient all unoriented edges, then place the FD edge to its correct position and finally end the solve in EPLL. The necessary intuitive steps are:

* P = M' U2 M
* O = M' U M
* O' = M' U' M

Using that plus some U turns you can solve any case, even all [[ELL]] case. For example, O U P = (M' U M) U (M' U2 M) is a sample algorithm which solves orientation, then places FD. There is a 1 in 12 chance that EPLL is skipped; otherwise there is one algorithm left.

There is another notation which can make it shorter to write algorithms:

* F(moves) = F2 (moves) F2

It is important here that the moves inside the parentheses keep the corners solved, so that they will still be correct after this algorithm. An example is the [[U-perm]], F(U P U) = F2 (U M' U2 M U) F2. F(O U') is a nice way to solve orientation and place FD all at once if the FD edge is in the middle of three unoriented edges in LL.

===Using algorithms===
The intuitive style lets you find and understand the orientation algorithms yourself. Another approach is to learn the algorithms instead of finding them; the cases are:

{| style="border: 1px solid #808080; color: black; background-color: #FAFAFA;" cellspacing="0" cellpadding="2"
| colspan="2" | <center>'''Basic orientations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:FUL Solved.jpg|80px]]
|NAME=''Intuitive solution''
|ALGO=''(Possibly optimised) alg''
|INFO=''Comment''
}}
|
{{Casebox
|IMAGE=[[Image:EO5 2 adjacent.jpg|80px]]
|NAME=O U2 O
|ALGO=(M' U M) U2 (M' U M)
|INFO=Orients UL and UB.
}}
|---
|
{{Casebox
|IMAGE=[[Image:EO5 2 opposite.jpg|80px]]
|NAME=O U' O
|ALGO=(M' U M) U' (M' U M)
|INFO=Orients UF and UB.
}}
|
{{Casebox
|IMAGE=[[Image:EO5 4.jpg|80px]]
|NAME=P U2 O'
|ALGO=(M' U2 M) U2 (M' U' M)
|INFO=Orients UR, UF, UL and UB
}}
|---
|
{{Casebox
|IMAGE=[[Image:EO5 1.jpg|80px]]
|NAME=O U O'
|ALGO=(M' U M) U (M' U' M)
|INFO=Orients FD and UB
}}
|
{{Casebox
|IMAGE=[[Image:EO5 3.jpg|80px]]
|NAME=O'
|ALGO=(M' U' M)
|INFO=Orients FD, UR, UF and UL
}}
|---
| colspan="2" | <center>''All images show white on top (U) and green in front (F).''</center>
|}
''More algs are at the [[L5EOP|L5EOP page]]''

Sometimes this will also solve the FD edge; the images show where the FD edge must be for the algorithm to solve it, but otherwise you should simply treat the yellow sticker as white. If you learn these positions, it can also be useful to learn the mirror algorithm for the case where FD is on the opposite side from the image. The easiest example is to use O' instead of O for the case with three flipped edges on U. Just like the intuitive step, if FD is not solved use P, and either way finish with [[EPLL]].

==Semi-advanced system==

[[L5EOP]] is an alternative to L5E, that always solves the FD edge while orienting ('P'lace). Then the last step will always be EPLL.

===FD placement + EPLL (L5EP)===
Another possibility for improving the intermediate style is to permutate the last five edges in one step. This only requires 16 algorithms in total, so counting the 5 orientations creates a system that solves L5E in two short steps. Even if you know this, it is still useful to place FD without extra moves if possible, since EPLL recognition is very fast.

We will introduce the following function:
* f(moves) = f2 (moves) [U] f2 ... This is the same as the F() function above, but with double layer f turns. Note that sometimes the adjusting U turns are not mentioned.

Here are the algorithms for permutation of all 5 edges; make sure to use AUF to place the FD edge at the position it has in the image.

{| style="border: 1px solid #808080; color: black; background-color: #FAFAFA;" cellspacing="0" cellpadding="2"
| colspan="2" | <center>'''Double two cycle permutations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:FUL Solved.jpg|80px]]
|NAME=''Intuitive solution''
|ALGO=''(Possibly optimised) alg''
|INFO=''Comment''
}}
|
{{Casebox
|IMAGE=[[Image:EP5 22 A.jpg|80px]]
|NAME=F(H-PLL)
|ALGO=(y') R U2 R2 U2 R2 U2 R
|INFO=Swaps UF<->DF and UR<->UL
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 22 B1.jpg|80px]]
|NAME=F(Z-PLL)
|ALGO=(y') r2 U' 2x(M E2) U r2
|INFO=Swaps UR<->DF and UL<->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 22 B2.jpg|80px]]
|NAME=F(Z-PLL')
|ALGO=(y') r2 U 2x(M E2) U' r2
|INFO=Swaps UL<->DF and UR<->UB
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 22 H.jpg|80px]]
|NAME=[[PLL#H Permutation|H-PLL]]
|ALGO=Ra U2 Ra' (y) Ra' U2 Ra
|INFO=Swaps UR<->UL and UF<->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 22 Z.jpg|80px]]
|NAME=[[PLL#Z Permutation|Z-PLL]]
|ALGO=M2 U' 2x(M E2) U M2
|INFO=Swaps UR<->UB and UL<->UF
}}
|---
| colspan="2" | <center>'''3-cycle permutations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:EP5 3 A.jpg|80px]]
|NAME=P
|ALGO= (M' U2 M)
|INFO=Cycles UF->DF->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 3 B1.jpg|80px]]
|NAME=f(d' P)
|ALGO=(y') r2 U' (M' U2 M) U' r2
|INFO=Cycles UL->UB->DF
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 3 B2.jpg|80px]]
|NAME=f(d P)
|ALGO=(y') r2 U (M U2 M') U r2
|INFO=Cycles UR->UB->DF
}}
|
{{Casebox
|IMAGE=[[Image:EP5 3 U1.jpg|80px]]
|NAME=[[PLL#U Permutation : b|U-PLL]]
|ALGO=F2 U (M' U2 M) U F2
|INFO=Cycles UF->UL->UR
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 3 U2.jpg|80px]]
|NAME=[[PLL#U Permutation : a|U-PLL']]
|ALGO=F2 U' (M' U2 M) U' F2
|INFO=Cycles UF->UR->UL
}}
|<center> </center>
|---
| colspan="2" | <center>'''5-cycle permutations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:EP5 5 H1.jpg|80px]]
|NAME=P U P
|ALGO=(M' U2 M) U (M' U2 M)
|INFO=Cycles UF->UL->UR->DF->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 5 H2.jpg|80px]]
|NAME=P U' P
|ALGO=(M' U2 M) U' (M' U2 M)
|INFO=Cycles UF->UR->UL->DF->UB
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 5 Z1.jpg|80px]]
|NAME=P Z-PLL
|ALGO=2x(M2 U) (M U2 M')
|INFO=Cycles UF->UR->UB->UL->FD
}}
|
{{Casebox
|IMAGE=[[Image:EP5 5 Z2.jpg|80px]]
|NAME=P Z-PLL'
|ALGO=2x(M2 U') (M U2 M')
|INFO=Cycles UF->UL->UB->UR->DF
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 5 U1.jpg|80px]]
|NAME=P U-PLL
|ALGO=(M' U2 M') U' (M' U2 M) U' M2
|INFO=Cycles UF->DF->UB->UL->UR
}}
|
{{Casebox
|IMAGE=[[Image:EP5 5 U2.jpg|80px]]
|NAME=P U-PLL'
|ALGO=(M' U2 M') U (M' U2 M) U M2
|INFO=Cycles UF->DF->UB->UR->UL
}}
|
|---
| colspan="2" | <center>''These images have white on top (U) and green in front (F). Darker pieces change positions.''</center>
|}

==Advanced system==
The most advanced system would be to simply solve in one step. Nobody has generated the algorithms for this yet, but it may not be a good idea because of the large number of cases and bad recognition. For the worst ones the algorithm will probably just be the same as in the 2-step solution, so the benefit will be small at best.

One case where this is useful (and doable) is to solve cases where at least one of the edges is solved at the start. Using setup turns and [[ELL]] this can be done in one step, although the recognition and setup moves might mean that this is not worth doing.

==See also==
* [[ELL]]
* [[PCMS]]
* [[L5EP]]

==External Links==
* [https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit L5EP Algorithms]
* [https://docs.google.com/spreadsheets/d/1feWj3FOAc6cH4Zpt_zGxuwJt8w_4aSkkmxoxpYzWdBA/edit?usp=sharing L5EP Algorithm Spreadsheet]
* [https://docs.google.com/spreadsheets/d/1VPtGoN_yDoWbBnPVgPWkqlNfj9YjN4LykrpKvUjrw-g Spreadsheet containing L5E algorithms]

[[Category:Experimental methods]]
[[Category:3x3x3 other substeps]]
[[Category:Acronyms]]

Speedsolving.com Wiki:Requested articles

2020-02-09T00:32:07Z

ProStar:

See [[Speedsolving.com Wiki:Manual of Style]] before creating articles.

== Templates ==
* separate [[Template:Substep Header]] out of [[Template:Substep Infobox]]
* [[Template:Partial Method Header]] and [[Template:Partial Method Infobox]]

== Brands ==
* [[Z]]
* [[BaiTai]]

== Books and Publications ==
* ''[[Cracking the Cube]]''
* ''[[Cubism For Fun]]'' newsletter
* ''[[De Hongaarse Kubus!]]'' (''[[The Hungarian Cube!]]'' in English)
* ''[[Rubik's Cubic Compendium]]''
* ''[[Conquer the Cube in 45 Seconds]]''
* ''[[The Winning Solution]]''

== Competitions ==
* [[CubingUSA Nationals 2019]] (US Nationals 2019)
* [[Manhasset Spring 2016]]
* [[European Rubik's Cube Championship 2012]]
* [[European Rubik's Cube Championship 2014]]
* [[European Rubik's Cube Championship 2016]]
* [[European Rubik's Cube Championship 2018]]
* [[Asian Championship 2012]]
* [[Asian Championship 2014]]
* [[Asian Championship 2016]]
* [[Asian Championship 2018]]
* [[South American Championship 2018]]
* [[UK Championship 2016]]
* [[UK Championship 2017]]
* [[UK Rubik's Cube Championship 2015]]
* [[UK Rubik's Cube Championship 2014]]
* [[UK Rubik's Cube Championship 2013]]
* [[UK Open 2012]]
* [[UK Open 2011]]
* [[UK Nationals 2010]]
* [[UK Open 2010]]
* [[UK Open 2009]]
* [[UK Open 2008]]
* [[UK Open 2007]]
* [[UK Open 2006]]

Eventual goal:
* Make a page on all notable WCA competitions

== Cubes ==
* [[TheValk 3]]
* [[TheValk 3 Power]]
* [[GoCube]]

== Cube Stores ==
* [[CANcube]]
* [[CubeSmith]]
* [[CubeDepot]]
* [[LighTake]]
* [[CubeZZ]]
* [[The Cube Market]]
* [[Cubicle Pro Shop]]
* [[Winning Moves]]

== Events ==
* [[3x3x3 no inspection]]

== Groups and Organizations ==
* [[/r/Cubers]] (r/Cubers, Cubers Subreddit)
* [[You CAN Do the Rubik's Cube]]
* [[Speedcubing.ro]]
* [[CubeMania]] (Cubemania.org)
* [[Stanford Rubik's Cube Club]]
* [[Cubing World]]

== Lawsuits ==
* [[Cubicle Enterprises LLC v. Rubik's Brand Limited]] (2018)

== Methods and Substeps ==
* [[HKOLL]]
* [[ZZ-HW]]
* [[Stadler Method]]
* [[27 algorithms]] method (Skewb)
* Steps : [[Std LBL edges]], ...
* [[3-2-3]]
* [[6-2]]
* [[3-2-2-2-3]]
* [[2-2-2-2-2-2]]
* [[TSR]]
* [[L7E]]
* [[WaterRoux]]
* [[Freestyle]] ([[Freestyle BLD]])
* [[4 pairs]]
* [[FOPP 1/4]]
* [[3D-Edg (pcms var2)]]
* [[Journey Method]] (for BLD)
* [[House Method]] (BLD)
* [[Story Method]] (BLD)
* [[Auditory Method]] (BLD)
* [[NISS]]
* [[Insertion]] (FMC technique)
* [[OLL-E]]
* [[OCE(P)LL]]
* [[L5EP]]

== Online Programs/Tools/Websites ==
* [[Groupifier]] (by Jonatan Klosko, posted on CF)
* [[CUBETimer]] (cubetimer.com)
* [[VideoTimer]]
* [[MinimalisTimer]]
* [[RubeTimer]]
* [[ImageCube]]
* [[NxNImagecube]]
* [[VisualCube]]
* [[Algorithm Translator]]
* [[NxMxL scrambler]]
* [[QBX]]
* [[Coracle]]
* [[Fantasy Cubing]]
* [[Cubecast Podcast]]
* [[Cubecast 2.0]]

== People ==
* [[Tony Fisher]]
* [[Tony Durham]]
* [[Myles Casanas]]
* [[Forte Shinko]]
* [[James Hildreth]]
* [[Thompson Clarke]]
* [[Corey Sakowski]]
* [[Alese Devin]] (JustKeepCubing)
* [[Sam Snodgrass]] (Cubey Time)
* [[Artur Kristof]] (Arcio)
* [[Deven Nadudvari]]
* [[Matt Rudnicki]]
* [[Arthur Adams]]
* [[Kavin Tangtartharakul]] (GuRoux)
* [[Callum Hales-Jepp]]
* [[Adam Polkowski]]
* [[Krzysztof Dąbrowski]]
* [[Marcin Jakubowski]]
* [[Kamil Pawlak]]
* [[Adam Joks]]
* [[Michał Bogdan]]
* [[David Adams]]
* [[Michał Burnicki]]
* [[Angel Lim]]
* [[Kalina Jakubowska]]
* [[Marcin Stachura]]
* [[Piotr Trząski]]
* [[Grzegorz Pacewicz]]
* [[Tristan Wright]]
* [[Piotr Frankowski]]
* [[Wojciech Szatanowski]]
* [[Piotr Kuchta]]
* [[Przyemysław Rogalski]]
* [[Hubert Hanusiak]]
* [[Robbie Villarica]]
* [[Karolina Wiącek]]
* [[Pavan Ravindra]]
* [[Ziheng Ma]]
* [[Yiwei Liu]]
* [[Walker Welch]]
* [[Sam Richard]]
* [[Damian Bias]] (Cubeologist)
* [[Dan Fast]] (CrazyBadCuber)
* [[Daniel Wannamaker]]
* [[Matthew Dickman]] (TehCubeDude)
* [[Haaris Jamil]] (ParadoxCubing)
* [[Sydney Weaver]]
* [[Bhargav Narasimhan]]
* [[Jiayu Wang]]
* [[Blake Thompson]]
* [[Alexander Carlier]]
* [[Andy Denney]]
* [[Joshua Feran]]
* [[Mark Boyanowski]]
* [[Justin Mallari]]
* [[Yi-Fan Wu]]
* [[Nathan Soria]]
* [[Éder dos Santos]]
* [[João Gabriel]]
* [[Daan Krammar]]
* [[Fabio Seiji]]
* [[Will Callan]]
* [[Gabriel Pitali]]
* [[Gustavo Penaforte]]
* [[Doug Li]]
* [[Sam Boyles]]
* [[Marlon Marques]]
* [[Pedro Santos]]
* [[Tommy Szeliga]]
* [[Nathan Dwyer]]
* [[Brandon Huang]]
* [[Henry Savich]]
* [[Rafael Cinoto]]
* [[Cyril Castella]]
* [[Guillaume Erbibou]] (Ofapel)
* [[Olivier Polspoel]] (Spols)
* [[Filippo Brancaleoni]]
* [[Jeong Jong-Ho]] or [[Jong-Ho Jeong]]
* [[Shivam Bansal]]
* [[Kit Clement]]
* [[Jeff Park]]
* [[Christian Pizzasegola]]
* [[Hilmar Magnusson]]
* [[Joel Spang]]
* [[Jonathan Irvin Gunawan]]
* [[Alex Maass]]
* [[Thomas Kaunzinger]]
* [[Ian Moore]]
* [[Lóreley Aiedail Tollaksdóttir Kuusisto]]
* [[John Li]] (Teoidus)
* [[Jacob Hutnyk]]
* [[Gabriel Alejandro Orozco Casillas]]
* [[Morten Arborg]]
* [[Cristian Leana]]
* [[Thomas Stadler]]
* [[Björn Korbanka]]
* [[Han-Cyun Chen]]
* [[Kailong Li]]
* [[Brayden Mossey]]
* [[Daan Kramer]]
* [[Shengliang Cai (蔡盛梁)]]
* [[Jonathan Cookmeyer]]
* [[Daniel Beyer]]
* [[Damjan Zagorec]]

== Products ==
* [[Martian Lube]] (Martian lubricant)
* [[Galaxy Lube]] (Galaxy lubricant)
* [[Nebula Lube]] (Nebula lubricant)
* [[Gravity Grip]]
* [[Z Lube]]

== Puzzle Types ==
* [[4D cubing]], [[3x3x3x3]], [[4D solving algorithms]] (by puzzle), [[higher dimensions cubing]]
* [[Helicopter cube]]
* [[Constrained cube (90°)]]
* [[Master Skewb]]
* [[Crazy 4×4×4 cube (version 1)‏‎]]
* [[Crazy 4×4×4 cube (version 2)]]
* [[Square-2‎]]
* [[Crazy 4×4×4 cube (version 3)]]
* [[Labyrinth cube]]
* [[Curvy Copter]]
* [[Shepherd's cube‏‎]]
* [[Rex cube‏‎]]
* [[Latch Cube]]
* [[Gear cube extreme‏‎]]
* All NxNxN puzzles (N=0,1,14,15,16,18,21,22,23,24,25,26,27,28,29)
* [[Golden Cube]]
* [[Smart Egg]]
* [[Pyracosaminx]]
* [[Icosaminx]]
* [[Super-X]]
* [[SwitchTiles]]
* [[Loopover]] (2D Rubik's cube)

== Software ==
* [[min2phase]]

== Terminology ==
* [[Singmaster Notation]]
* [[SiGN]] notation
* [[Factory solve]]
* [[Washer]] (hardware)
* [[torpedo]]
* [[ball bearing]]
* [[brand]]
* [[Judge]]
* [[magnetic cube]]
* [[Per Special]]
* [[WCA Candidate Delegate]]
* [[Tension]] (tensions, tensioning)
* [[Cube state]]
* [[Sticker variation]]
* [[Catch]] or [[Catches]]
* [[Move]]/[[Turn]]
* [[Sticker]]
* [[Puzzle Hardware]]
* [[Last Slot]]
* [[Piece]]
* Cube states : [[LL:EO+EP cube state‏‎]], [[LL:EO+CO+CP cube state]] ...
* [[1gen]]
* [[5gen]]
* [[6gen]]
* [[feet (hardware)]]
* [[Case]] (as in "this OLL case")
* Weight 0.1 through 8
* [[brand]]
* [[L3C cube state]]
* [[3-cycle]]
* [[Square Group]]
* [[Timer]]
* [[F2L-1E (D) cube state]]
* [[5LLL]]
* [[Look]]s (as in 1LLL, 2LLL, 4LLL, etc.)
* [[15 puzzle]]
* [[Sum of Ranks]] (discuss both Sum of Average Ranks and Single Ranks)
* [[Sum of Average Ranks]]
* [[Sum of Single Ranks]]

== Other requests ==
* delete protected file <nowiki>[[File:Thomascharms1155.jpg]]</nowiki> (vandalism)
* fix all [[Special:DoubleRedirects]]

[[Category:Speedsolving.com Wiki maintenance]]

Speedsolving.com Wiki:Requested articles

2020-02-09T00:31:25Z

ProStar: /* Methods and Substeps */

See [[Speedsolving.com Wiki:Manual of Style]] before creating articles.

== Templates ==
* separate [[Template:Substep Header]] out of [[Template:Substep Infobox]]
* [[Template:Partial Method Header]] and [[Template:Partial Method Infobox]]

== Brands ==
* [[Z]]
* [[BaiTai]]

== Books and Publications ==
* ''[[Cracking the Cube]]''
* ''[[Cubism For Fun]]'' newsletter
* ''[[De Hongaarse Kubus!]]'' (''[[The Hungarian Cube!]]'' in English)
* ''[[Rubik's Cubic Compendium]]''
* ''[[Conquer the Cube in 45 Seconds]]''
* ''[[The Winning Solution]]''

== Competitions ==
* [[CubingUSA Nationals 2019]] (US Nationals 2019)
* [[Manhasset Spring 2016]]
* [[European Rubik's Cube Championship 2012]]
* [[European Rubik's Cube Championship 2014]]
* [[European Rubik's Cube Championship 2016]]
* [[European Rubik's Cube Championship 2018]]
* [[Asian Championship 2012]]
* [[Asian Championship 2014]]
* [[Asian Championship 2016]]
* [[Asian Championship 2018]]
* [[South American Championship 2018]]
* [[UK Championship 2016]]
* [[UK Championship 2017]]
* [[UK Rubik's Cube Championship 2015]]
* [[UK Rubik's Cube Championship 2014]]
* [[UK Rubik's Cube Championship 2013]]
* [[UK Open 2012]]
* [[UK Open 2011]]
* [[UK Nationals 2010]]
* [[UK Open 2010]]
* [[UK Open 2009]]
* [[UK Open 2008]]
* [[UK Open 2007]]
* [[UK Open 2006]]

Eventual goal:
* Make a page on all notable WCA competitions

== Cubes ==
* [[TheValk 3]]
* [[TheValk 3 Power]]
* [[GoCube]]

== Cube Stores ==
* [[CANcube]]
* [[CubeSmith]]
* [[CubeDepot]]
* [[LighTake]]
* [[CubeZZ]]
* [[The Cube Market]]
* [[Cubicle Pro Shop]]
* [[Winning Moves]]

== Events ==
* [[3x3x3 no inspection]]

== Groups and Organizations ==
* [[/r/Cubers]] (r/Cubers, Cubers Subreddit)
* [[You CAN Do the Rubik's Cube]]
* [[Speedcubing.ro]]
* [[CubeMania]] (Cubemania.org)
* [[Stanford Rubik's Cube Club]]
* [[Cubing World]]

== Lawsuits ==
* [[Cubicle Enterprises LLC v. Rubik's Brand Limited]] (2018)

== Methods and Substeps ==
* [[HKOLL]]
* [[ZZ-HW]]
* [[Stadler Method]]
* [[27 algorithms]] method (Skewb)
* Steps : [[Std LBL edges]], ...
* [[3-2-3]]
* [[6-2]]
* [[3-2-2-2-3]]
* [[2-2-2-2-2-2]]
* [[TSR]]
* [[L7E]]
* [[WaterRoux]]
* [[Freestyle]] ([[Freestyle BLD]])
* [[4 pairs]]
* [[FOPP 1/4]]
* [[3D-Edg (pcms var2)]]
* [[Journey Method]] (for BLD)
* [[House Method]] (BLD)
* [[Story Method]] (BLD)
* [[Auditory Method]] (BLD)
* [[NISS]]
* [[Insertion]] (FMC technique)

== Online Programs/Tools/Websites ==
* [[Groupifier]] (by Jonatan Klosko, posted on CF)
* [[CUBETimer]] (cubetimer.com)
* [[VideoTimer]]
* [[MinimalisTimer]]
* [[RubeTimer]]
* [[ImageCube]]
* [[NxNImagecube]]
* [[VisualCube]]
* [[Algorithm Translator]]
* [[NxMxL scrambler]]
* [[QBX]]
* [[Coracle]]
* [[Fantasy Cubing]]
* [[Cubecast Podcast]]
* [[Cubecast 2.0]]

== People ==
* [[Tony Fisher]]
* [[Tony Durham]]
* [[Myles Casanas]]
* [[Forte Shinko]]
* [[James Hildreth]]
* [[Thompson Clarke]]
* [[Corey Sakowski]]
* [[Alese Devin]] (JustKeepCubing)
* [[Sam Snodgrass]] (Cubey Time)
* [[Artur Kristof]] (Arcio)
* [[Deven Nadudvari]]
* [[Matt Rudnicki]]
* [[Arthur Adams]]
* [[Kavin Tangtartharakul]] (GuRoux)
* [[Callum Hales-Jepp]]
* [[Adam Polkowski]]
* [[Krzysztof Dąbrowski]]
* [[Marcin Jakubowski]]
* [[Kamil Pawlak]]
* [[Adam Joks]]
* [[Michał Bogdan]]
* [[David Adams]]
* [[Michał Burnicki]]
* [[Angel Lim]]
* [[Kalina Jakubowska]]
* [[Marcin Stachura]]
* [[Piotr Trząski]]
* [[Grzegorz Pacewicz]]
* [[Tristan Wright]]
* [[Piotr Frankowski]]
* [[Wojciech Szatanowski]]
* [[Piotr Kuchta]]
* [[Przyemysław Rogalski]]
* [[Hubert Hanusiak]]
* [[Robbie Villarica]]
* [[Karolina Wiącek]]
* [[Pavan Ravindra]]
* [[Ziheng Ma]]
* [[Yiwei Liu]]
* [[Walker Welch]]
* [[Sam Richard]]
* [[Damian Bias]] (Cubeologist)
* [[Dan Fast]] (CrazyBadCuber)
* [[Daniel Wannamaker]]
* [[Matthew Dickman]] (TehCubeDude)
* [[Haaris Jamil]] (ParadoxCubing)
* [[Sydney Weaver]]
* [[Bhargav Narasimhan]]
* [[Jiayu Wang]]
* [[Blake Thompson]]
* [[Alexander Carlier]]
* [[Andy Denney]]
* [[Joshua Feran]]
* [[Mark Boyanowski]]
* [[Justin Mallari]]
* [[Yi-Fan Wu]]
* [[Nathan Soria]]
* [[Éder dos Santos]]
* [[João Gabriel]]
* [[Daan Krammar]]
* [[Fabio Seiji]]
* [[Will Callan]]
* [[Gabriel Pitali]]
* [[Gustavo Penaforte]]
* [[Doug Li]]
* [[Sam Boyles]]
* [[Marlon Marques]]
* [[Pedro Santos]]
* [[Tommy Szeliga]]
* [[Nathan Dwyer]]
* [[Brandon Huang]]
* [[Henry Savich]]
* [[Rafael Cinoto]]
* [[Cyril Castella]]
* [[Guillaume Erbibou]] (Ofapel)
* [[Olivier Polspoel]] (Spols)
* [[Filippo Brancaleoni]]
* [[Jeong Jong-Ho]] or [[Jong-Ho Jeong]]
* [[Shivam Bansal]]
* [[Kit Clement]]
* [[Jeff Park]]
* [[Christian Pizzasegola]]
* [[Hilmar Magnusson]]
* [[Joel Spang]]
* [[Jonathan Irvin Gunawan]]
* [[Alex Maass]]
* [[Thomas Kaunzinger]]
* [[Ian Moore]]
* [[Lóreley Aiedail Tollaksdóttir Kuusisto]]
* [[John Li]] (Teoidus)
* [[Jacob Hutnyk]]
* [[Gabriel Alejandro Orozco Casillas]]
* [[Morten Arborg]]
* [[Cristian Leana]]
* [[Thomas Stadler]]
* [[Björn Korbanka]]
* [[Han-Cyun Chen]]
* [[Kailong Li]]
* [[Brayden Mossey]]
* [[Daan Kramer]]
* [[Shengliang Cai (蔡盛梁)]]
* [[Jonathan Cookmeyer]]
* [[Daniel Beyer]]
* [[Damjan Zagorec]]

== Products ==
* [[Martian Lube]] (Martian lubricant)
* [[Galaxy Lube]] (Galaxy lubricant)
* [[Nebula Lube]] (Nebula lubricant)
* [[Gravity Grip]]
* [[Z Lube]]

== Puzzle Types ==
* [[4D cubing]], [[3x3x3x3]], [[4D solving algorithms]] (by puzzle), [[higher dimensions cubing]]
* [[Helicopter cube]]
* [[Constrained cube (90°)]]
* [[Master Skewb]]
* [[Crazy 4×4×4 cube (version 1)‏‎]]
* [[Crazy 4×4×4 cube (version 2)]]
* [[Square-2‎]]
* [[Crazy 4×4×4 cube (version 3)]]
* [[Labyrinth cube]]
* [[Curvy Copter]]
* [[Shepherd's cube‏‎]]
* [[Rex cube‏‎]]
* [[Latch Cube]]
* [[Gear cube extreme‏‎]]
* All NxNxN puzzles (N=0,1,14,15,16,18,21,22,23,24,25,26,27,28,29)
* [[Golden Cube]]
* [[Smart Egg]]
* [[Pyracosaminx]]
* [[Icosaminx]]
* [[Super-X]]
* [[SwitchTiles]]
* [[Loopover]] (2D Rubik's cube)

== Software ==
* [[min2phase]]

== Subsets ==
* [[OLL-E]]
* [[OCE(P)LL]]
* [[L5EP]]

== Terminology ==
* [[Singmaster Notation]]
* [[SiGN]] notation
* [[Factory solve]]
* [[Washer]] (hardware)
* [[torpedo]]
* [[ball bearing]]
* [[brand]]
* [[Judge]]
* [[magnetic cube]]
* [[Per Special]]
* [[WCA Candidate Delegate]]
* [[Tension]] (tensions, tensioning)
* [[Cube state]]
* [[Sticker variation]]
* [[Catch]] or [[Catches]]
* [[Move]]/[[Turn]]
* [[Sticker]]
* [[Puzzle Hardware]]
* [[Last Slot]]
* [[Piece]]
* Cube states : [[LL:EO+EP cube state‏‎]], [[LL:EO+CO+CP cube state]] ...
* [[1gen]]
* [[5gen]]
* [[6gen]]
* [[feet (hardware)]]
* [[Case]] (as in "this OLL case")
* Weight 0.1 through 8
* [[brand]]
* [[L3C cube state]]
* [[3-cycle]]
* [[Square Group]]
* [[Timer]]
* [[F2L-1E (D) cube state]]
* [[5LLL]]
* [[Look]]s (as in 1LLL, 2LLL, 4LLL, etc.)
* [[15 puzzle]]
* [[Sum of Ranks]] (discuss both Sum of Average Ranks and Single Ranks)
* [[Sum of Average Ranks]]
* [[Sum of Single Ranks]]

== Other requests ==
* delete protected file <nowiki>[[File:Thomascharms1155.jpg]]</nowiki> (vandalism)
* fix all [[Special:DoubleRedirects]]

[[Category:Speedsolving.com Wiki maintenance]]

Speedsolving.com Wiki:Requested articles

2020-02-09T00:30:50Z

ProStar: /* Subsets */

See [[Speedsolving.com Wiki:Manual of Style]] before creating articles.

== Templates ==
* separate [[Template:Substep Header]] out of [[Template:Substep Infobox]]
* [[Template:Partial Method Header]] and [[Template:Partial Method Infobox]]

== Brands ==
* [[Z]]
* [[BaiTai]]

== Books and Publications ==
* ''[[Cracking the Cube]]''
* ''[[Cubism For Fun]]'' newsletter
* ''[[De Hongaarse Kubus!]]'' (''[[The Hungarian Cube!]]'' in English)
* ''[[Rubik's Cubic Compendium]]''
* ''[[Conquer the Cube in 45 Seconds]]''
* ''[[The Winning Solution]]''

== Competitions ==
* [[CubingUSA Nationals 2019]] (US Nationals 2019)
* [[Manhasset Spring 2016]]
* [[European Rubik's Cube Championship 2012]]
* [[European Rubik's Cube Championship 2014]]
* [[European Rubik's Cube Championship 2016]]
* [[European Rubik's Cube Championship 2018]]
* [[Asian Championship 2012]]
* [[Asian Championship 2014]]
* [[Asian Championship 2016]]
* [[Asian Championship 2018]]
* [[South American Championship 2018]]
* [[UK Championship 2016]]
* [[UK Championship 2017]]
* [[UK Rubik's Cube Championship 2015]]
* [[UK Rubik's Cube Championship 2014]]
* [[UK Rubik's Cube Championship 2013]]
* [[UK Open 2012]]
* [[UK Open 2011]]
* [[UK Nationals 2010]]
* [[UK Open 2010]]
* [[UK Open 2009]]
* [[UK Open 2008]]
* [[UK Open 2007]]
* [[UK Open 2006]]

Eventual goal:
* Make a page on all notable WCA competitions

== Cubes ==
* [[TheValk 3]]
* [[TheValk 3 Power]]
* [[GoCube]]

== Cube Stores ==
* [[CANcube]]
* [[CubeSmith]]
* [[CubeDepot]]
* [[LighTake]]
* [[CubeZZ]]
* [[The Cube Market]]
* [[Cubicle Pro Shop]]
* [[Winning Moves]]

== Events ==
* [[3x3x3 no inspection]]

== Groups and Organizations ==
* [[/r/Cubers]] (r/Cubers, Cubers Subreddit)
* [[You CAN Do the Rubik's Cube]]
* [[Speedcubing.ro]]
* [[CubeMania]] (Cubemania.org)
* [[Stanford Rubik's Cube Club]]
* [[Cubing World]]

== Lawsuits ==
* [[Cubicle Enterprises LLC v. Rubik's Brand Limited]] (2018)

== Methods and Substeps ==
* [[HKOLL]]
* [[ZZ-HW]]
* [[Stadler Method]]
* [[27 algorithms]] method (Skewb)
* Steps : [[Std LBL edges]], ...
* [[3-2-3]]
* [[6-2]]
* [[3-2-2-2-3]]
* [[2-2-2-2-2-2]]
* [[TSR]]
* [[L7E]]
* [[WaterRoux]]
* [[Freestyle]] ([[Freestyle BLD]])
* [[4 pairs]]
* [[FOPP 1/4]]
* [[3D-Edg (pcms var2)]]
* [[Journey Method]] (for BLD)
* [[House Method]] (BLD)
* [[Story Method]] (BLD)
* [[Auditory Method]] (BLD)
* [[NISS]]
* [[Insertion]] (FMC technique)
* [[AbsoRoux]] (Roux on big cubes)

== Online Programs/Tools/Websites ==
* [[Groupifier]] (by Jonatan Klosko, posted on CF)
* [[CUBETimer]] (cubetimer.com)
* [[VideoTimer]]
* [[MinimalisTimer]]
* [[RubeTimer]]
* [[ImageCube]]
* [[NxNImagecube]]
* [[VisualCube]]
* [[Algorithm Translator]]
* [[NxMxL scrambler]]
* [[QBX]]
* [[Coracle]]
* [[Fantasy Cubing]]
* [[Cubecast Podcast]]
* [[Cubecast 2.0]]

== People ==
* [[Tony Fisher]]
* [[Tony Durham]]
* [[Myles Casanas]]
* [[Forte Shinko]]
* [[James Hildreth]]
* [[Thompson Clarke]]
* [[Corey Sakowski]]
* [[Alese Devin]] (JustKeepCubing)
* [[Sam Snodgrass]] (Cubey Time)
* [[Artur Kristof]] (Arcio)
* [[Deven Nadudvari]]
* [[Matt Rudnicki]]
* [[Arthur Adams]]
* [[Kavin Tangtartharakul]] (GuRoux)
* [[Callum Hales-Jepp]]
* [[Adam Polkowski]]
* [[Krzysztof Dąbrowski]]
* [[Marcin Jakubowski]]
* [[Kamil Pawlak]]
* [[Adam Joks]]
* [[Michał Bogdan]]
* [[David Adams]]
* [[Michał Burnicki]]
* [[Angel Lim]]
* [[Kalina Jakubowska]]
* [[Marcin Stachura]]
* [[Piotr Trząski]]
* [[Grzegorz Pacewicz]]
* [[Tristan Wright]]
* [[Piotr Frankowski]]
* [[Wojciech Szatanowski]]
* [[Piotr Kuchta]]
* [[Przyemysław Rogalski]]
* [[Hubert Hanusiak]]
* [[Robbie Villarica]]
* [[Karolina Wiącek]]
* [[Pavan Ravindra]]
* [[Ziheng Ma]]
* [[Yiwei Liu]]
* [[Walker Welch]]
* [[Sam Richard]]
* [[Damian Bias]] (Cubeologist)
* [[Dan Fast]] (CrazyBadCuber)
* [[Daniel Wannamaker]]
* [[Matthew Dickman]] (TehCubeDude)
* [[Haaris Jamil]] (ParadoxCubing)
* [[Sydney Weaver]]
* [[Bhargav Narasimhan]]
* [[Jiayu Wang]]
* [[Blake Thompson]]
* [[Alexander Carlier]]
* [[Andy Denney]]
* [[Joshua Feran]]
* [[Mark Boyanowski]]
* [[Justin Mallari]]
* [[Yi-Fan Wu]]
* [[Nathan Soria]]
* [[Éder dos Santos]]
* [[João Gabriel]]
* [[Daan Krammar]]
* [[Fabio Seiji]]
* [[Will Callan]]
* [[Gabriel Pitali]]
* [[Gustavo Penaforte]]
* [[Doug Li]]
* [[Sam Boyles]]
* [[Marlon Marques]]
* [[Pedro Santos]]
* [[Tommy Szeliga]]
* [[Nathan Dwyer]]
* [[Brandon Huang]]
* [[Henry Savich]]
* [[Rafael Cinoto]]
* [[Cyril Castella]]
* [[Guillaume Erbibou]] (Ofapel)
* [[Olivier Polspoel]] (Spols)
* [[Filippo Brancaleoni]]
* [[Jeong Jong-Ho]] or [[Jong-Ho Jeong]]
* [[Shivam Bansal]]
* [[Kit Clement]]
* [[Jeff Park]]
* [[Christian Pizzasegola]]
* [[Hilmar Magnusson]]
* [[Joel Spang]]
* [[Jonathan Irvin Gunawan]]
* [[Alex Maass]]
* [[Thomas Kaunzinger]]
* [[Ian Moore]]
* [[Lóreley Aiedail Tollaksdóttir Kuusisto]]
* [[John Li]] (Teoidus)
* [[Jacob Hutnyk]]
* [[Gabriel Alejandro Orozco Casillas]]
* [[Morten Arborg]]
* [[Cristian Leana]]
* [[Thomas Stadler]]
* [[Björn Korbanka]]
* [[Han-Cyun Chen]]
* [[Kailong Li]]
* [[Brayden Mossey]]
* [[Daan Kramer]]
* [[Shengliang Cai (蔡盛梁)]]
* [[Jonathan Cookmeyer]]
* [[Daniel Beyer]]
* [[Damjan Zagorec]]

== Products ==
* [[Martian Lube]] (Martian lubricant)
* [[Galaxy Lube]] (Galaxy lubricant)
* [[Nebula Lube]] (Nebula lubricant)
* [[Gravity Grip]]
* [[Z Lube]]

== Puzzle Types ==
* [[4D cubing]], [[3x3x3x3]], [[4D solving algorithms]] (by puzzle), [[higher dimensions cubing]]
* [[Helicopter cube]]
* [[Constrained cube (90°)]]
* [[Master Skewb]]
* [[Crazy 4×4×4 cube (version 1)‏‎]]
* [[Crazy 4×4×4 cube (version 2)]]
* [[Square-2‎]]
* [[Crazy 4×4×4 cube (version 3)]]
* [[Labyrinth cube]]
* [[Curvy Copter]]
* [[Shepherd's cube‏‎]]
* [[Rex cube‏‎]]
* [[Latch Cube]]
* [[Gear cube extreme‏‎]]
* All NxNxN puzzles (N=0,1,14,15,16,18,21,22,23,24,25,26,27,28,29)
* [[Golden Cube]]
* [[Smart Egg]]
* [[Pyracosaminx]]
* [[Icosaminx]]
* [[Super-X]]
* [[SwitchTiles]]
* [[Loopover]] (2D Rubik's cube)

== Software ==
* [[min2phase]]

== Subsets ==
* [[OLL-E]]
* [[OCE(P)LL]]
* [[L5EP]]

== Terminology ==
* [[Singmaster Notation]]
* [[SiGN]] notation
* [[Factory solve]]
* [[Washer]] (hardware)
* [[torpedo]]
* [[ball bearing]]
* [[brand]]
* [[Judge]]
* [[magnetic cube]]
* [[Per Special]]
* [[WCA Candidate Delegate]]
* [[Tension]] (tensions, tensioning)
* [[Cube state]]
* [[Sticker variation]]
* [[Catch]] or [[Catches]]
* [[Move]]/[[Turn]]
* [[Sticker]]
* [[Puzzle Hardware]]
* [[Last Slot]]
* [[Piece]]
* Cube states : [[LL:EO+EP cube state‏‎]], [[LL:EO+CO+CP cube state]] ...
* [[1gen]]
* [[5gen]]
* [[6gen]]
* [[feet (hardware)]]
* [[Case]] (as in "this OLL case")
* Weight 0.1 through 8
* [[brand]]
* [[L3C cube state]]
* [[3-cycle]]
* [[Square Group]]
* [[Timer]]
* [[F2L-1E (D) cube state]]
* [[5LLL]]
* [[Look]]s (as in 1LLL, 2LLL, 4LLL, etc.)
* [[15 puzzle]]
* [[Sum of Ranks]] (discuss both Sum of Average Ranks and Single Ranks)
* [[Sum of Average Ranks]]
* [[Sum of Single Ranks]]

== Other requests ==
* delete protected file <nowiki>[[File:Thomascharms1155.jpg]]</nowiki> (vandalism)
* fix all [[Special:DoubleRedirects]]

[[Category:Speedsolving.com Wiki maintenance]]

WVCP

2020-02-09T00:29:00Z

ProStar: /* See also */

{{Substep Infobox
|name=WVCP
|image=WVCP.png
|proposers=Unknown
|year=Unknown
|variants=[[WV]], [[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=Unknown
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair cube state]]
|next=[[LL:EO+CO+CP cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[SVCP]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]
* [[SVCP]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

SVCP

2020-02-09T00:26:41Z

ProStar:

{{Substep Infobox
|name=SVCP
|image=WVCP.png
|proposers=Unknown
|year=Unknown
|variants=[[Summer Variation]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=Unknown
|purpose=
* [[Speedsolving]]
|previous=[[SV setup cube state]]
|next=[[LL:EO+CO+CP cube state]]
}}

'''Summer Variation Corners Permute''', abbreviated as '''SVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are in the R U R' case in the U-Layer. In the R U' R' case, [[WVCP]] can be applied. After using SVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 SVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations.

== See also ==
* [[Summer Variation]]
* [[WVCP]]

[[Category:3x3x3 last slot substeps]]

SVCP

2020-02-09T00:26:14Z

ProStar: Created page with "{{Substep Infobox |name=SVCP |image=WVCP.png |proposers=Unknown |year=Unknown |variants=SV |subgroup= |algs= 378 (189 excluding mirrors) |moves=Unknown |purpose=</sup..."

{{Substep Infobox
|name=SVCP
|image=WVCP.png
|proposers=Unknown
|year=Unknown
|variants=[[SV]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=Unknown
|purpose=
* [[Speedsolving]]
|previous=[[SV setup cube state]]
|next=[[LL:EO+CO+CP cube state]]
}}

'''Summer Variation Corners Permute''', abbreviated as '''SVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are in the R U R' case in the U-Layer. In the R U' R' case, [[WVCP]] can be applied. After using SVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 SVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations.

== See also ==
* [[Summer Variation]]
* [[WVCP]]

[[Category:3x3x3 last slot substeps]]

Winter Variation

2020-02-09T00:23:33Z

ProStar: /* See also */

{{Substep Infobox
|name=WV
|image=winter_variation.gif
|proposers=[[Lucas Winter]]
|year=2005
|anames=F2LL
|variants=[[ZZ-WV]] [[WVCP]]
|subgroup=
|algs=54 (27 excluding mirrors)
|moves=8.07
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair+EO cube state]]
|next=[[LL:EO+CO cube state]]
}}

'''Winter Variation''', abbreviated as '''WV''', sometimes referred to as '''F2LL''', is a subset of [[VLS]] used for orienting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot. It is generally used in conjunction with methods in which the last layer edges are already oriented before insertion of the final F2L block, such as [[ZZ]] or [[Petrus]].

WV may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case [[Summer Variation]] can be applied. After using WV, all the pieces will be correctly oriented in the last layer, and the solver must use [[PLL]] algorithms to correctly position them.

There are 27 Winter Variation algorithms total, one for each configuration of corner orientations. WV cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot. Recognition of cases is typically done by looking at 3 of the corners in the top layer (the last corner's orientation is always dependent on the other 3). Since the last slot can potentially be in 1 of 4 positions, the solver must readily be able to recognize mirror cases and apply mirror algorithms in order to use WV.

The benefit to learning WV is that the solver uses fewer moves than directly placing the final c/e pair and using standard [[OCLL]] algorithms. The average move count for optimal WV algorithms is 8.07. In addition, PLL algorithms are generally well known, since PLL is the last step of the popular [[Fridrich]] method.

The original description and rationale for this variation can be seen in the yahoo speedsolvingrubikscube group [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/14346 here].

== See also ==
* [[Partial Corner Control]]
* [[Summer Variation]]
* [[VLS]]
* [[HLS]]
* [[CLS]]
* [[EJLS]]
* [[WVCP]]

== External links ==
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/14346 A variation on the Petrus Method] - initial proposal of the method
* [http://pagesperso-orange.fr/absolutemind/f2ll-angl.htm Sebastien Felix's WV Page]
* [http://web.mac.com/teisenmann/Tripod/winter.html Jack Eisenmann's WV Page]
* [http://dragoncube.org/vh_f2l.html Dragon Cube WV Page]
* YouTube: [http://www.youtube.com/watch?v=V2uIqju7ZJo F2LL Winter Variation]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14096 F2LL winter variation, is it worth learning?]
* [https://www.speedcubingtips.eu/winter-variations/ Speedcubingtips.eu Winter Variation algs]

[[Category:3x3x3 last slot substeps]]

Summer Variation

2020-02-09T00:22:56Z

ProStar:

{{Substep Infobox
|name=Summer Variation
|image=
|proposers=[[Chester Lian]]
|year=2009
|anames=
|variants=[[SVCP]]
|steps=
|algs=54 (27 excluding mirrors)
|moves=9.4 [[HTM]]
|purpose=
* [[Speedsolving]]
|previous=[[SV setup cube case]]
|next=[[LL:EO+CO cube state]]
}}

'''Summer Variation''' is the 3x3x3 subset of [[HLS]] for orienting the last layer corners while solving the R U R' case (or the mirror) for the last slot's F2L pair. This set of algorithms could be learned as an addition to [[Winter Variation]].

==Identification==
It can be hard to distinguish between different Winter/Summer cases. They all look very similar. One way to identify each individual case when you are learning is to assign a number to each corner and remember which string of numbers corresponds to which algorithm. This is slow when starting, but eventually you wont think of the numbers anymore. The three number string in front of each algorithm refers to UFR, UBR,and UBL respectively, for winter variation and UBR,UBL, and UFL respectively for summer variation. The s and w after the three numbers means it is either summer or winter variation. A zero means that corner is correctly oriented, a 1 means one turn CCW and a 2 means one turn CW.

For example, after doing (R U R') we get case 100w. The first corner is turned CCW, 1, the other two are correctly oriented, 0 and 0, and it is a winter variation case. Another example, after doing (R U R' U R U R') we get case 012s. the first corner, in UBR, is correctly oriented, 0, the second is turned CCW, 1, and the last one is turned CW, 2, and it is a summer variation case. Conversely, a third example, case 102s means this is a summer variation, the "s" after it, and the first corner, in UBR, is turned CCW, the second, in UBL, is oriented, and the third in UFL is turned CW.

==Algorithms==
This set of algorithms maintains edge orientation, so they can be helpful when using methods such as [[Petrus]] or [[ZZ]] which already have the edges oriented on the [[LL]].

+++++++++++++++++++++++++++++++++++++++++++++++++++++++

000s (L' U2) (R U R') (U2 L) (U' R U R') or L R U' R' U L' U2 R U' R'

001s R U R' U R' U2 R U R' U R

002s R U R D R' U R D' R' U' R'

010s (U2 L) (R U'R')(U L')

011s R U' L' U L U2 R' L' U L

012s R U' R' U' R U' R'

020s R U R'

021s R U2 R' U' L' U R U' R' L

022s R U' R' L' U R U' R' L U' R U' R'

+++++++++++++++++++++++++++++++++++++++++++++++++++++++

100s R U R' U' R U R' U R U2 R'

101s R U2 R' U R U2 R'

102s R2 U R' U R' U' R2 U R' U' R U' R2

110s U L' R U R' U R U' R' U2 L

111s U2 L R U' R2 U L' U' R

112s R U2 R' U R U' R' U R U2 R'

120s R U' R D R' U2 R D' R2

121s R U R2 U2 R U R' U R

122s R U2 R D R' U' R D' R2

+++++++++++++++++++++++++++++++++++++++++++++++++++++++

200s R U L' U' L' U R' U' L U L

201s R U' R' U' R U R' U' R U' R'

202s R U' R2 U' R2 U' R2 U2 R

210s R U R2 U' R U' R' U2 R

211s R U' R' U' R U' R2 U' R U' R' U2 R

212s R U R' U R' U' R U' R' U2 R

220s R U R D' R U' R' D R U R

221s U' R U R D R' U R D' R2

222s R' U L U' R2 U R' L'

+++++++++++++++++++++++++++++++++++++++++++++++++++++++

== See also ==
* [[Advanced F2L]]
* [[Winter Variation]]
* [[ZZ]]
* [[SVCP]]

== External links ==
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=8820 COLS/"Summer Variation"/set of algs without a name]

[[Category:3x3x3 last slot substeps]]

WVCP

2020-02-09T00:21:41Z

ProStar:

{{Substep Infobox
|name=WVCP
|image=WVCP.png
|proposers=Unknown
|year=Unknown
|variants=[[WV]], [[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=Unknown
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair cube state]]
|next=[[LL:EO+CO+CP cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[SVCP]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

WVCP

2020-02-09T00:21:08Z

ProStar: Added image

{{Substep Infobox
|name=WVCP
|image=WVCP.png
|proposers=Unknown
|year=Unknown
|variants=[[WV]], [[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=Unknown
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair+EO cube state]]
|next=[[LL:EO+CO cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[SVCP]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

File:WVCP.png

2020-02-09T00:20:10Z

ProStar: WVCP Picture

== Summary ==
WVCP Picture

WVCP

2020-02-09T00:07:04Z

ProStar:

{{Substep Infobox
|name=WVCP
|image=
|proposers=Unknown
|year=Unknown
|variants=[[WV]], [[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=Unknown
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair+EO cube state]]
|next=[[LL:EO+CO cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[SVCP]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

WVCP

2020-02-09T00:06:22Z

ProStar:

{{Substep Infobox
|name=WVCP
|image=
|proposers=Unknown
|year=Unknown
|variants=[[WV]], [[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=8.07
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair+EO cube state]]
|next=[[LL:EO+CO cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[SVCP]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

WVCP

2020-02-09T00:06:09Z

ProStar:

{{Substep Infobox
|name=WVCP
|image=
|proposers=Unknown
|year=Unknown
|variants=[[WV]][[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=8.07
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair+EO cube state]]
|next=[[LL:EO+CO cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[SVCP]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

WVCP

2020-02-09T00:05:50Z

ProStar:

{{Substep Infobox
|name=WV
|image=winter_variation.gif
|proposers=Unknown
|year=Unknown
|variants=[[WV]][[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=8.07
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair+EO cube state]]
|next=[[LL:EO+CO cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[SVCP]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

WVCP

2020-02-09T00:05:22Z

ProStar: Created page with "{{Substep Infobox |name=WV |image=winter_variation.gif |proposers=Unknown |year=Unknown |variants=WVSVCP |subgroup= |algs= 378 (189 excluding mirrors) |moves=8.07 |pur..."

{{Substep Infobox
|name=WV
|image=winter_variation.gif
|proposers=Unknown
|year=Unknown
|variants=[[WV]][[SVCP]]
|subgroup=
|algs= 378 (189 excluding mirrors)
|moves=8.07
|purpose=
* [[Speedsolving]]
|previous=[[F2L-1+pair+EO cube state]]
|next=[[LL:EO+CO cube state]]
}}

'''Winter Variation Corners Permute''', abbreviated as '''WVCP''', is a subset of [[CLP]] used for orienting and permuting the [[Last Layer|last layer]] corners during insertion of the final [[F2L]] slot while preserving [[Edge Orientation]].

WVCP may only be used in last slot cases where the final corner-edge pair are already connected in the U-Layer. In the R U R' case, [[Summer Variation Corners Permute]] can be applied. After using WVCP, all the corner pieces will be correctly oriented and permuted in the last layer.

There are 189 WVCP algorithms total(excluding mirrors), one for each combination of corner orientation and permutations. WVCP cases are set up so there is a corner-edge pair in the top layer to be placed in the final slot.

== See also ==
* [[Winter Variation]]

== External links ==
* [https://docs.google.com/spreadsheets/d/1Y5LvkbkeBgxUMljzZ4onySvNe-ylyF23qHs8OZKIagc/edit?usp=sharing/ List of WVCP Algorithms]

[[Category:3x3x3 last slot substeps]]

List of Subsets

2020-02-08T23:51:11Z

ProStar: /* 3x3 Subsets */

== 2x2 Subsets ==
*[[CLL]]
*[[EG]]
*[[TCLL]]
*[[OLL]]
*[[PBL]]
*[[SS]]
*[[Anti-CLL]]

== 3x3 Subsets ==
*[[OLL]]
*[[PLL]]
*[[COLL]]
*[[WV]]
*[[Magic Wondeful]]
*[[BLE]]
*[[VLS]]
*[[CLS]]
*[[F2L]]
*[[2GLL]]
*[[ELL]]
*[[ELS]]
*[[CMLL]]
*[[ZBLL]]
*[[OLLCP]]
*[[BLL]]
*[[CLLEF]]
*[[L3C]]
*[[L4C]]
*[[LPELL]]
*[[OPLL]]
*[[BBF2L]]
*[[EJF2L]]
*[[Cardan Reduction]]
*[[CPLS]]
*[[JTLE]]
*[[LSE]]
*[[EO]]
*[[EOLR]]
*[[MGLS]]
*[[Pure OLL]]
*[[1LLL]]
*[[TripodLL]]
*[[2BlockLL]]
*[[Anti-PLL]]
*[[2GR]]
*[[HKLL]]
*[[TOLS]]
*[[TSLE]]
*[[TTLL]]
*[[1LLLL]]
*[[ZZF2L]]
*[[Phasing]]
*[[OLS]]
*[[CPEO]]
*[[WVCP]]
*[[SVCP]]
*[[Skyler Variation]]
*[[ZZ-Tripod]]
*[[LMCF]]
*[[Opposite EPLL]]
*[[LCEO]]
*[[ZBLS]]
*[[RLS]]
*[[TCMLL]]
*[[OCEPLL]]

== 4x4 Subsets ==
*[[OLL Parity]]
*[[CxLL]]
*L2C
*[[Dedge]]

== 5x5 Subsets ==
*L2C
*L2E

== Pyraminx Subsets ==
*[[WO]]
*[[L3E]]
*[[L4E]]
*[[1-Flip]]
*[[2-Flip]]
*[[Nutella]]

== Square-1 Subsets ==
*EO
*CP
*EP
*[[Square-1 PLL]]
*[[Lin Method]]
*OBL
*PBL
*L5E
*L4E/L3E
*CSP

== Skewb Subsets ==
*[[Advanced Sarah's]]
*[[Skewb CLL]]
*[[Skewb EG]]
*[[Skewb TCLL/CLS]]
*[[L5C]]
*[[NS]]
*[[Skewb VLS]]
*[[Welder's Mask]]
*[[Advanced Ranzha]]

== Megaminx Subsets ==
*[[Megaminx PLL]]
*[[Megaminx OLL]]
*[[Megaminx ELL]]
*[[Megaminx L3C]]
*[[Megaminx VHLS]]
*[[Megaminx WV]]

[[Category:Lists|S]]

Petrus-W

2020-02-08T21:17:56Z

ProStar: /* External links */

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners while preserving EO using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* EO is more free than in [[Petrus Method|Petrus]]
* L2P has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like in [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* [[L5EP]] has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look

==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit?usp=sharing/ L5EP Algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-08T21:15:37Z

ProStar: /* Cons */

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners while preserving EO using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* EO is more free than in [[Petrus Method|Petrus]]
* L2P has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like in [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* [[L5EP]] has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look

==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-08T21:15:05Z

ProStar: /* Steps */

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners while preserving EO using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* EO is more free than in [[Petrus Method|Petrus]]
* L2P has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* L5EP has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look
==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-08T20:41:56Z

ProStar: Petrus users orient 4 edges at a time, and ZZ EO is freer than Petrus-W EO

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* EO is more free than in [[Petrus Method|Petrus]]
* L2P has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* L5EP has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look
==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-08T20:10:29Z

ProStar: Better alg sheet

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* EO is more free than in [[Petrus Method|Petrus]]
* L2P has less regrips than in [[Petrus]] [[F2L]]
* Unlike in [[Petrus]] or [[ZZ]], one has the ability to work with the empty DF edge during L2P
* You can orient 4 edges at a time, instead of being restricted to 2 at a time as in basic [[Petrus]]

==Cons==
* Just like [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* L5EP has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look
==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/document/d/1oZO7TXjWXZOiokOaENHd-7b5IjIvYQ_Vt5yFYNziI5A/edit?usp=sharing/ L5EP Algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-08T14:31:44Z

ProStar: /* Pros */

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:''' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* EO is more free than in [[Petrus Method|Petrus]]
* L2P has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* L5EP has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look
==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-07T20:24:55Z

ProStar: Cleaned up the article

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# '''2x2:''' Solve a [[2x2x2 block]] in the back of the cube
# '''2x2x3:''' Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# '''EO:'' Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# '''L2P:''' Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves only the [[last layer]] and the Down-Front edge piece to be solved
# '''COLL:''' Solve the remaining 4 corners using [[COLL]]
# '''L5EP:''' Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
* Very few cube rotations are required; if you are able to plan your [[2x2x3 Block|2x2x3]] in inspection, the number drops to zero
* You can orient 4 edges at a time, instead of being restricted to 2 at a time as in [[Petrus]]
* EO is more free than in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]]
* L2P has less regrips than in [[Petrus]] [[F2L]]

==Cons==
* Just like [[Petrus Method|Petrus]], you cannot look into EO during inspection time
* L5EP has slightly more algorithms than EPLL
* Unlike in [[Petrus Method|Petrus]] or [[ZZ Method|ZZ]], you cannot easily solve the [[last layer]] in one look
==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-07T19:42:23Z

ProStar: Rewrote history section, made some minor changes to the article

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# Solve a [[2x2x2 block]] in the back of the cube
# Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# Fix the misoriented edges on the cube with [[ZZ Method|ZZ]]-style [[EO]] (Edges oriented relative to where it belongs on the U, F, and D layers)
# Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves the [[last layer]] and the Down-Front edge piece to be solved
# Solve the remaining 4 corners using [[COLL]]
# Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
# If you can look into the 2x2x3 block in inspection, no cube rotations are required
# You can orient 4 edges at a time, instead of being restricted to the 2 allowed in [[Petrus]]
# You can use M' U' M to orient edges unlike in [[Petrus]] or [[ZZ]]
# [[F2L]] has less regrips than in [[Petrus]] [[F2L]]

==Cons==
# Unlike in the [[ZZ]] method, you cannot look into EO during inspection time
# L5EP has 7 more algorithms than EPLL
# Unlike in [[Petrus]] or [[ZZ]], you cannot use [[ZZLL]] or [[ZBLL]] to complete the [[Last Layer]] in one look
==History==
Petrus-W was originally proposed on the [[SpeedSolving Forums]] by user WarriorCatCuber on February 6, 2020. According to the creator, the idea came from a misinterpretation of another user's critique of a solve with the [[Petrus Method]]. After some thought and improvement, WarriorCatCuber decided to show the other [[SpeedSolving Forums|forum]] users his new idea.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico|Portico Method]]
* [[COLL]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

K4

2020-02-07T19:29:30Z

ProStar:

{{Method Infobox
|name=K4
|image=K4.gif
|proposers=[[Thom Barlow]]
|year=2005
|anames=
|variants=[[CF3L]]
|steps=7
|moves= ~120
|algs= Mostly commutators
|purpose=|purpose=
* [[Speedsolving]]
}}

'''K4''', short for '''Kirjava's 4x4x4 Method''', mixes reduction, blockbuilding, edge pairing and direct solving techniques to produce a method that can quickly and efficiently solve a 4x4x4 (Revenge) cube.

It should be noted that while K4 is designed specifically for the 4x4x4 cube, it can be applied to any size of cube. Modifications can be made to make it friendlier to solve on the bigger (>=5x5x5) cubes.

== Overview ==
The K4 Method consists of 7 steps;

# Two opposite centres
# Blockbuild a 1x3x4 block
# Complete the last four centres
# Complete the first layer
# Rotationless F3L
# CLL
# 3 look ELL

== Pros ==
Small number of rotations required

Efficient movecount

Extremely good F3L lookahead

== Cons ==
Commutators are required for a good understanding of the method

ELL can be difficult for beginners to grasp

== External links ==
* [http://snk.digibase.ca/k4/ K4 tutorial]
* [https://www.speedsolving.com/forum/threads/k4.19598/ K4 Thread]
* [http://www.kungfoomanchu.com/guides/k4.pdf Single Page PDF Guide]
* [http://www.speedsolving.com/forum/showthread.php?30015-Calculating-the-Number-of-K4-quot-OLLs-quot-on-an-nxnxn-Cube&p=596542&viewfull=1#post596542/ Number of "K4 OLLs" in the last layer of the nxnxn cube (Puzzle Theory)]

[[Category:Big Cube methods]]
[[Category:4x4x4 methods]]

[[Category:Acronyms]]

Petrus Method

2020-02-07T19:23:11Z

ProStar:

{{Method Infobox
|name=Petrus
|image=Petrus_method.gif
|proposers=[[Lars Petrus]]
|year=1981
|anames
|algs=2 to 493 (for the last layer)
|variants=[[Petrus-W]]
|steps=7
|moves=~50
|purpose=
* [[Fewest Moves]]
* [[Speedsolving]]
}}

{{Method Header
|listofsteps=[[2x2x2 Block]] -> [[2x2x3 Block]] -> [[EO Petrus]] -> [[Petrus F2L]] -> [[LL+EO:CP]] -> [[LL+EO+CP:CO]] -> [[EPLL]]
|description='''Petrus''' was the second most popular speedcubing method behind [[CFOP]].
}}

The '''Petrus Method''', invented by [[Lars Petrus]], is a block-building [[method]] where the [[F2L]] is solved intuitively with no [[algorithm]]s. Petrus was the second most popular speedcubing method behind [[Fridrich]]/[[CFOP]]; however other methods like [[ZZ]] and [[Roux]] are currently more popular.

The Petrus Method is sometimes partially used in [[CFOP]] solves for [[XCross]].

== The Steps ==
The following steps describe an approach suited for beginners, more advanced users might combine steps 1 and 2 and/or 5 and 6 ([[COLL]]) or use a [[Fridrich]] type last layer and do [[OLL]] and then [[PLL]]. If the fifth step is skipped the last layer can be solved with a [[2GLL]] algorithm.

1. Build a [[2x2x2 block]] anywhere on the cube.

2. Expand the [[2x2x2 block]] to a [[2x2x3 block]]; three ways are possible for each initial [[2x2x2 block]] placement.

3. Fix the "bad edges" (in other words, orient the remaining seven edges on the cube that have not been solved).

4. Finish the First Two Layers (F2L) by only turning 2 sides. The pure Petrus approach is to create a 1x2x2 block and expand it to a 1x2x3 block to finish off the F2L, not to solve the cross piece and two corner/edge pairs; two ways are possible. The last-layer edges will orientate themselves automatically.

5. Permute the last-layer corners (put them in their correct places).

6. Orient the last-layer corners, making the whole last layer a solid colour.

7. Permute the last layer edges, without disturbing the other pieces, to solve the cube.

== Pros ==

* The Petrus Method uses fewer moves than the [[Fridrich]] method and most, if not all, other non-block-building methods.
* It is more intuitive than the Fridrich method, and it requires far fewer algorithms.
* It requires fewer algorithms than some beginner methods (including the most popular one: [[Layer By Layer]]).
* If [[COLL]] is used as well, one can orient and permute the corners at the same time.
* The last layer can even be solved in one look with [[ZBLL]] or [[ZZLL]], however this drastically increases the number of algorithms one must learn.

== Cons ==

* It can be sometimes hard (especially for a beginner) to optimize block building, and it's difficult to keep consistently turning throughout the solve.

* Due to the high amount of intuition, it is difficult to optimize finger tricks during the block building stage.

* Recognition in the Edge Orientation step tends to result in long pauses.

== Petrus variations ==

* '''[[Petrus-W]]:''' [[ZZ]]-style [[EO]] is used to finish to final two [[Pair|CE Pairs]] with only R U L moves while not placing the Down-Front edge. [[COLL]] and [[L5EP]] is then used to finish the cube.

* [[Substep]]s like [[EJLS]], [[WV]], [[COLL]], [[ZZLL]], and [[ZBLL]] can be used to finish the [[last layer]] in a single algorithm

== Petrus as a Beginner Method ==

Used as a beginner method, Petrus requires much more intuition, but also involves learning fewer algorithms. For a tutorial, see the external links below.

== External links ==

* [http://lar5.com/cube/ Lars Petrus's tutorial]
* [http://petrus-speed.netne.net/ Petrus Speed Website]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?t=14014 YouTube Beginner Petrus Tutorial]
* YouTube: [http://www.youtube.com/watch?v=EQ9OrFVQw0o Petrus Tutorial] by fallofshadows
* YouTube: [http://www.youtube.com/watch?v=WqXdO2H2FTs Petrus Tutorial] by CuberChris

[[Category:3x3x3 methods]]
[[Category:3x3x3 beginner methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus Method

2020-02-07T19:22:40Z

ProStar: /* Petrus variations */

{{Method Infobox
|name=Petrus
|image=Petrus_method.gif
|proposers=[[Lars Petrus]]
|year=1981
|anames
|algs=2 to 493 (for the last layer)
|variants=[[Petrus-W]]
|steps=7
|moves=~50
|purpose=
* [[Fewest Moves]]
* [[Speedsolving]]
}}

{{Method Header
|listofsteps=[[2x2x2 Block]] -> [[2x2x3 Block]] -> [[EO Petrus]] -> [[Petrus F2L]] -> [[LL+EO:CP]] -> [[LL+EO+CP:CO]] -> [[EPLL]]
|description='''Petrus''' was the second most popular speedcubing method behind [[CFOP]].
}}

The '''Petrus Method''', invented by [[Lars Petrus]], is a block-building [[method]] where the [[F2L]] is solved intuitively with no [[algorithm]]s. Petrus was the second most popular speedcubing method behind [[Fridrich]]/[[CFOP]]; however other methods like [[ZZ]] and [[Roux]] are currently more popular.

The Petrus Method is sometimes partially used in [[CFOP]] solves for [[XCross]].

== The Steps ==
The following steps describe an approach suited for beginners, more advanced users might combine steps 1 and 2 and/or 5 and 6 ([[COLL]]) or use a [[Fridrich]] type last layer and do [[OLL]] and then [[PLL]]. If the fifth step is skipped the last layer can be solved with a [[2GLL]] algorithm.

1. Build a [[2x2x2 block]] anywhere on the cube.

2. Expand the [[2x2x2 block]] to a [[2x2x3 block]]; three ways are possible for each initial [[2x2x2 block]] placement.

3. Fix the "bad edges" (in other words, orient the remaining seven edges on the cube that have not been solved).

4. Finish the First Two Layers (F2L) by only turning 2 sides. The pure Petrus approach is to create a 1x2x2 block and expand it to a 1x2x3 block to finish off the F2L, not to solve the cross piece and two corner/edge pairs; two ways are possible. The last-layer edges will orientate themselves automatically.

5. Permute the last-layer corners (put them in their correct places).

6. Orient the last-layer corners, making the whole last layer a solid colour.

7. Permute the last layer edges, without disturbing the other pieces, to solve the cube.

== Pros ==

* The Petrus Method uses fewer moves than the [[Fridrich]] method and most, if not all, other non-block-building methods.
* It is more intuitive than the Fridrich method, and it requires far fewer algorithms.
* It requires fewer algorithms than some beginner methods (including the most popular one: [[Layer By Layer]]).
* If [[COLL]] is used as well, one can orient and permute the corners at the same time.
* The last layer can even be solved in one look with [[ZBLL]] or [[ZZLL]], however this drastically increases the number of algorithms one must learn.

== Cons ==

* It can be sometimes hard (especially for a beginner) to optimize block building, and it's difficult to keep consistently turning throughout the solve.

* Due to the high amount of intuition, it is difficult to optimize finger tricks during the block building stage.

* Recognition in the Edge Orientation step tends to result in long pauses.

== Petrus variations ==

* '''[[Petrus-W]]:''' [[ZZ]]-style [[EO]] is used to finish to final two [[Pairs|pairs]] with only R U L moves while not placing the Down-Front edge. [[COLL]] and [[L5EP]] is then used to finish the cube.

* [[Substep]]s like [[EJLS]], [[WV]], [[COLL]], [[ZZLL]], and [[ZBLL]] can be used to finish the [[last layer]] in a single algorithm

== Petrus as a Beginner Method ==

Used as a beginner method, Petrus requires much more intuition, but also involves learning fewer algorithms. For a tutorial, see the external links below.

== External links ==

* [http://lar5.com/cube/ Lars Petrus's tutorial]
* [http://petrus-speed.netne.net/ Petrus Speed Website]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?t=14014 YouTube Beginner Petrus Tutorial]
* YouTube: [http://www.youtube.com/watch?v=EQ9OrFVQw0o Petrus Tutorial] by fallofshadows
* YouTube: [http://www.youtube.com/watch?v=WqXdO2H2FTs Petrus Tutorial] by CuberChris

[[Category:3x3x3 methods]]
[[Category:3x3x3 beginner methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus Method

2020-02-07T19:22:16Z

ProStar: Better explanation of Petrus-W

{{Method Infobox
|name=Petrus
|image=Petrus_method.gif
|proposers=[[Lars Petrus]]
|year=1981
|anames
|algs=2 to 493 (for the last layer)
|variants=[[Petrus-W]]
|steps=7
|moves=~50
|purpose=
* [[Fewest Moves]]
* [[Speedsolving]]
}}

{{Method Header
|listofsteps=[[2x2x2 Block]] -> [[2x2x3 Block]] -> [[EO Petrus]] -> [[Petrus F2L]] -> [[LL+EO:CP]] -> [[LL+EO+CP:CO]] -> [[EPLL]]
|description='''Petrus''' was the second most popular speedcubing method behind [[CFOP]].
}}

The '''Petrus Method''', invented by [[Lars Petrus]], is a block-building [[method]] where the [[F2L]] is solved intuitively with no [[algorithm]]s. Petrus was the second most popular speedcubing method behind [[Fridrich]]/[[CFOP]]; however other methods like [[ZZ]] and [[Roux]] are currently more popular.

The Petrus Method is sometimes partially used in [[CFOP]] solves for [[XCross]].

== The Steps ==
The following steps describe an approach suited for beginners, more advanced users might combine steps 1 and 2 and/or 5 and 6 ([[COLL]]) or use a [[Fridrich]] type last layer and do [[OLL]] and then [[PLL]]. If the fifth step is skipped the last layer can be solved with a [[2GLL]] algorithm.

1. Build a [[2x2x2 block]] anywhere on the cube.

2. Expand the [[2x2x2 block]] to a [[2x2x3 block]]; three ways are possible for each initial [[2x2x2 block]] placement.

3. Fix the "bad edges" (in other words, orient the remaining seven edges on the cube that have not been solved).

4. Finish the First Two Layers (F2L) by only turning 2 sides. The pure Petrus approach is to create a 1x2x2 block and expand it to a 1x2x3 block to finish off the F2L, not to solve the cross piece and two corner/edge pairs; two ways are possible. The last-layer edges will orientate themselves automatically.

5. Permute the last-layer corners (put them in their correct places).

6. Orient the last-layer corners, making the whole last layer a solid colour.

7. Permute the last layer edges, without disturbing the other pieces, to solve the cube.

== Pros ==

* The Petrus Method uses fewer moves than the [[Fridrich]] method and most, if not all, other non-block-building methods.
* It is more intuitive than the Fridrich method, and it requires far fewer algorithms.
* It requires fewer algorithms than some beginner methods (including the most popular one: [[Layer By Layer]]).
* If [[COLL]] is used as well, one can orient and permute the corners at the same time.
* The last layer can even be solved in one look with [[ZBLL]] or [[ZZLL]], however this drastically increases the number of algorithms one must learn.

== Cons ==

* It can be sometimes hard (especially for a beginner) to optimize block building, and it's difficult to keep consistently turning throughout the solve.

* Due to the high amount of intuition, it is difficult to optimize finger tricks during the block building stage.

* Recognition in the Edge Orientation step tends to result in long pauses.

== Petrus variations ==

* '''[[Petrus-W]]:''' [[ZZ]]-style [[EO]] is used to finish to final two [[pairs]] with only R U L moves while not placing the Down-Front edge. [[COLL]] and [[L5EP]] is then used to finish the cube.

* [[Substep]]s like [[EJLS]], [[WV]], [[COLL]], [[ZZLL]], and [[ZBLL]] can be used to finish the [[last layer]] in a single algorithm

== Petrus as a Beginner Method ==

Used as a beginner method, Petrus requires much more intuition, but also involves learning fewer algorithms. For a tutorial, see the external links below.

== External links ==

* [http://lar5.com/cube/ Lars Petrus's tutorial]
* [http://petrus-speed.netne.net/ Petrus Speed Website]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?t=14014 YouTube Beginner Petrus Tutorial]
* YouTube: [http://www.youtube.com/watch?v=EQ9OrFVQw0o Petrus Tutorial] by fallofshadows
* YouTube: [http://www.youtube.com/watch?v=WqXdO2H2FTs Petrus Tutorial] by CuberChris

[[Category:3x3x3 methods]]
[[Category:3x3x3 beginner methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Speedsolving.com Wiki:Requested articles

2020-02-07T19:01:46Z

ProStar: /* People */

See [[Speedsolving.com Wiki:Manual of Style]] before creating articles.

== Templates ==
* separate [[Template:Substep Header]] out of [[Template:Substep Infobox]]
* [[Template:Partial Method Header]] and [[Template:Partial Method Infobox]]

== Brands ==
* [[Z]]
* [[BaiTai]]

== Books and Publications ==
* ''[[Cracking the Cube]]''
* ''[[Cubism For Fun]]'' newsletter
* ''[[De Hongaarse Kubus!]]'' (''[[The Hungarian Cube!]]'' in English)
* ''[[Rubik's Cubic Compendium]]''
* ''[[Conquer the Cube in 45 Seconds]]''
* ''[[The Winning Solution]]''

== Competitions ==
* [[CubingUSA Nationals 2019]] (US Nationals 2019)
* [[Manhasset Spring 2016]]
* [[European Rubik's Cube Championship 2012]]
* [[European Rubik's Cube Championship 2014]]
* [[European Rubik's Cube Championship 2016]]
* [[European Rubik's Cube Championship 2018]]
* [[Asian Championship 2012]]
* [[Asian Championship 2014]]
* [[Asian Championship 2016]]
* [[Asian Championship 2018]]
* [[South American Championship 2018]]
* [[UK Championship 2016]]
* [[UK Championship 2017]]
* [[UK Rubik's Cube Championship 2015]]
* [[UK Rubik's Cube Championship 2014]]
* [[UK Rubik's Cube Championship 2013]]
* [[UK Open 2012]]
* [[UK Open 2011]]
* [[UK Nationals 2010]]
* [[UK Open 2010]]
* [[UK Open 2009]]
* [[UK Open 2008]]
* [[UK Open 2007]]
* [[UK Open 2006]]

Eventual goal:
* Make a page on all notable WCA competitions

== Cubes ==
* [[TheValk 3]]
* [[TheValk 3 Power]]
* [[GoCube]]

== Cube Stores ==
* [[CANcube]]
* [[CubeSmith]]
* [[CubeDepot]]
* [[LighTake]]
* [[CubeZZ]]
* [[The Cube Market]]
* [[Cubicle Pro Shop]]
* [[Winning Moves]]

== Events ==
* [[3x3x3 no inspection]]

== Groups and Organizations ==
* [[/r/Cubers]] (r/Cubers, Cubers Subreddit)
* [[You CAN Do the Rubik's Cube]]
* [[Speedcubing.ro]]
* [[CubeMania]] (Cubemania.org)
* [[Stanford Rubik's Cube Club]]
* [[Cubing World]]

== Lawsuits ==
* [[Cubicle Enterprises LLC v. Rubik's Brand Limited]] (2018)

== Methods and Substeps ==
* [[HKOLL]]
* [[ZZ-HW]]
* [[Stadler Method]]
* [[27 algorithms]] method (Skewb)
* Steps : [[Std LBL edges]], ...
* [[3-2-3]]
* [[6-2]]
* [[3-2-2-2-3]]
* [[2-2-2-2-2-2]]
* [[TSR]]
* [[L7E]]
* [[WaterRoux]]
* [[Freestyle]] ([[Freestyle BLD]])
* [[4 pairs]]
* [[FOPP 1/4]]
* [[3D-Edg (pcms var2)]]
* [[Journey Method]] (for BLD)
* [[House Method]] (BLD)
* [[Story Method]] (BLD)
* [[Auditory Method]] (BLD)
* [[NISS]]
* [[Insertion]] (FMC technique)
* [[AbsoRoux]] (Roux on big cubes)

== Online Programs/Tools/Websites ==
* [[Groupifier]] (by Jonatan Klosko, posted on CF)
* [[CUBETimer]] (cubetimer.com)
* [[VideoTimer]]
* [[MinimalisTimer]]
* [[RubeTimer]]
* [[ImageCube]]
* [[NxNImagecube]]
* [[VisualCube]]
* [[Algorithm Translator]]
* [[NxMxL scrambler]]
* [[QBX]]
* [[Coracle]]
* [[Fantasy Cubing]]
* [[Cubecast Podcast]]
* [[Cubecast 2.0]]

== People ==
* [[Tony Fisher]]
* [[Tony Durham]]
* [[Myles Casanas]]
* [[Forte Shinko]]
* [[James Hildreth]]
* [[Thompson Clarke]]
* [[Corey Sakowski]]
* [[Alese Devin]] (JustKeepCubing)
* [[Sam Snodgrass]] (Cubey Time)
* [[Artur Kristof]] (Arcio)
* [[Deven Nadudvari]]
* [[Matt Rudnicki]]
* [[Arthur Adams]]
* [[Kavin Tangtartharakul]] (GuRoux)
* [[Callum Hales-Jepp]]
* [[Adam Polkowski]]
* [[Krzysztof Dąbrowski]]
* [[Marcin Jakubowski]]
* [[Kamil Pawlak]]
* [[Adam Joks]]
* [[Michał Bogdan]]
* [[David Adams]]
* [[Michał Burnicki]]
* [[Angel Lim]]
* [[Kalina Jakubowska]]
* [[Marcin Stachura]]
* [[Piotr Trząski]]
* [[Grzegorz Pacewicz]]
* [[Tristan Wright]]
* [[Piotr Frankowski]]
* [[Wojciech Szatanowski]]
* [[Piotr Kuchta]]
* [[Przyemysław Rogalski]]
* [[Hubert Hanusiak]]
* [[Robbie Villarica]]
* [[Karolina Wiącek]]
* [[Pavan Ravindra]]
* [[Ziheng Ma]]
* [[Yiwei Liu]]
* [[Walker Welch]]
* [[Sam Richard]]
* [[Damian Bias]] (Cubeologist)
* [[Dan Fast]] (CrazyBadCuber)
* [[Daniel Wannamaker]]
* [[Matthew Dickman]] (TehCubeDude)
* [[Haaris Jamil]] (ParadoxCubing)
* [[Sydney Weaver]]
* [[Bhargav Narasimhan]]
* [[Jiayu Wang]]
* [[Blake Thompson]]
* [[Alexander Carlier]]
* [[Andy Denney]]
* [[Joshua Feran]]
* [[Mark Boyanowski]]
* [[Justin Mallari]]
* [[Yi-Fan Wu]]
* [[Nathan Soria]]
* [[Éder dos Santos]]
* [[João Gabriel]]
* [[Daan Krammar]]
* [[Fabio Seiji]]
* [[Will Callan]]
* [[Gabriel Pitali]]
* [[Gustavo Penaforte]]
* [[Doug Li]]
* [[Sam Boyles]]
* [[Marlon Marques]]
* [[Pedro Santos]]
* [[Tommy Szeliga]]
* [[Nathan Dwyer]]
* [[Brandon Huang]]
* [[Henry Savich]]
* [[Rafael Cinoto]]
* [[Cyril Castella]]
* [[Guillaume Erbibou]] (Ofapel)
* [[Olivier Polspoel]] (Spols)
* [[Filippo Brancaleoni]]
* [[Jeong Jong-Ho]] or [[Jong-Ho Jeong]]
* [[Shivam Bansal]]
* [[Kit Clement]]
* [[Jeff Park]]
* [[Christian Pizzasegola]]
* [[Hilmar Magnusson]]
* [[Joel Spang]]
* [[Jonathan Irvin Gunawan]]
* [[Alex Maass]]
* [[Thomas Kaunzinger]]
* [[Ian Moore]]
* [[Lóreley Aiedail Tollaksdóttir Kuusisto]]
* [[John Li]] (Teoidus)
* [[Jacob Hutnyk]]
* [[Gabriel Alejandro Orozco Casillas]]
* [[Morten Arborg]]
* [[Cristian Leana]]
* [[Thomas Stadler]]
* [[Björn Korbanka]]
* [[Han-Cyun Chen]]
* [[Kailong Li]]
* [[Brayden Mossey]]
* [[Daan Kramer]]
* [[Shengliang Cai (蔡盛梁)]]
* [[Jonathan Cookmeyer]]
* [[Daniel Beyer]]
* [[Damjan Zagorec]]

== Products ==
* [[Martian Lube]] (Martian lubricant)
* [[Galaxy Lube]] (Galaxy lubricant)
* [[Nebula Lube]] (Nebula lubricant)
* [[Gravity Grip]]
* [[Z Lube]]

== Puzzle Types ==
* [[4D cubing]], [[3x3x3x3]], [[4D solving algorithms]] (by puzzle), [[higher dimensions cubing]]
* [[Helicopter cube]]
* [[Constrained cube (90°)]]
* [[Master Skewb]]
* [[Crazy 4×4×4 cube (version 1)‏‎]]
* [[Crazy 4×4×4 cube (version 2)]]
* [[Square-2‎]]
* [[Crazy 4×4×4 cube (version 3)]]
* [[Labyrinth cube]]
* [[Curvy Copter]]
* [[Shepherd's cube‏‎]]
* [[Rex cube‏‎]]
* [[Latch Cube]]
* [[Gear cube extreme‏‎]]
* All NxNxN puzzles (N=0,1,14,15,16,18,21,22,23,24,25,26,27,28,29)
* [[Golden Cube]]
* [[Smart Egg]]
* [[Pyracosaminx]]
* [[Icosaminx]]
* [[Super-X]]
* [[SwitchTiles]]
* [[Loopover]] (2D Rubik's cube)

== Software ==
* [[min2phase]]

== Subsets ==
* [[OLL-E]]
* [[OCE(P)LL]]
* [[WVCP]]
* [[L5EP]]

== Terminology ==
* [[Singmaster Notation]]
* [[SiGN]] notation
* [[Factory solve]]
* [[Washer]] (hardware)
* [[torpedo]]
* [[ball bearing]]
* [[brand]]
* [[Judge]]
* [[magnetic cube]]
* [[Per Special]]
* [[WCA Candidate Delegate]]
* [[Tension]] (tensions, tensioning)
* [[Cube state]]
* [[Sticker variation]]
* [[Catch]] or [[Catches]]
* [[Move]]/[[Turn]]
* [[Sticker]]
* [[Puzzle Hardware]]
* [[Last Slot]]
* [[Piece]]
* Cube states : [[LL:EO+EP cube state‏‎]], [[LL:EO+CO+CP cube state]] ...
* [[1gen]]
* [[5gen]]
* [[6gen]]
* [[feet (hardware)]]
* [[Case]] (as in "this OLL case")
* Weight 0.1 through 8
* [[brand]]
* [[L3C cube state]]
* [[3-cycle]]
* [[Square Group]]
* [[Timer]]
* [[F2L-1E (D) cube state]]
* [[5LLL]]
* [[Look]]s (as in 1LLL, 2LLL, 4LLL, etc.)
* [[15 puzzle]]
* [[Sum of Ranks]] (discuss both Sum of Average Ranks and Single Ranks)
* [[Sum of Average Ranks]]
* [[Sum of Single Ranks]]

== Other requests ==
* delete protected file <nowiki>[[File:Thomascharms1155.jpg]]</nowiki> (vandalism)
* fix all [[Special:DoubleRedirects]]

[[Category:Speedsolving.com Wiki maintenance]]

Speedsolving.com Wiki:Requested articles

2020-02-07T19:01:28Z

ProStar:

See [[Speedsolving.com Wiki:Manual of Style]] before creating articles.

== Templates ==
* separate [[Template:Substep Header]] out of [[Template:Substep Infobox]]
* [[Template:Partial Method Header]] and [[Template:Partial Method Infobox]]

== Brands ==
* [[Z]]
* [[BaiTai]]

== Books and Publications ==
* ''[[Cracking the Cube]]''
* ''[[Cubism For Fun]]'' newsletter
* ''[[De Hongaarse Kubus!]]'' (''[[The Hungarian Cube!]]'' in English)
* ''[[Rubik's Cubic Compendium]]''
* ''[[Conquer the Cube in 45 Seconds]]''
* ''[[The Winning Solution]]''

== Competitions ==
* [[CubingUSA Nationals 2019]] (US Nationals 2019)
* [[Manhasset Spring 2016]]
* [[European Rubik's Cube Championship 2012]]
* [[European Rubik's Cube Championship 2014]]
* [[European Rubik's Cube Championship 2016]]
* [[European Rubik's Cube Championship 2018]]
* [[Asian Championship 2012]]
* [[Asian Championship 2014]]
* [[Asian Championship 2016]]
* [[Asian Championship 2018]]
* [[South American Championship 2018]]
* [[UK Championship 2016]]
* [[UK Championship 2017]]
* [[UK Rubik's Cube Championship 2015]]
* [[UK Rubik's Cube Championship 2014]]
* [[UK Rubik's Cube Championship 2013]]
* [[UK Open 2012]]
* [[UK Open 2011]]
* [[UK Nationals 2010]]
* [[UK Open 2010]]
* [[UK Open 2009]]
* [[UK Open 2008]]
* [[UK Open 2007]]
* [[UK Open 2006]]

Eventual goal:
* Make a page on all notable WCA competitions

== Cubes ==
* [[TheValk 3]]
* [[TheValk 3 Power]]
* [[GoCube]]

== Cube Stores ==
* [[CANcube]]
* [[CubeSmith]]
* [[CubeDepot]]
* [[LighTake]]
* [[CubeZZ]]
* [[The Cube Market]]
* [[Cubicle Pro Shop]]
* [[Winning Moves]]

== Events ==
* [[3x3x3 no inspection]]

== Groups and Organizations ==
* [[/r/Cubers]] (r/Cubers, Cubers Subreddit)
* [[You CAN Do the Rubik's Cube]]
* [[Speedcubing.ro]]
* [[CubeMania]] (Cubemania.org)
* [[Stanford Rubik's Cube Club]]
* [[Cubing World]]

== Lawsuits ==
* [[Cubicle Enterprises LLC v. Rubik's Brand Limited]] (2018)

== Methods and Substeps ==
* [[HKOLL]]
* [[ZZ-HW]]
* [[Stadler Method]]
* [[27 algorithms]] method (Skewb)
* Steps : [[Std LBL edges]], ...
* [[3-2-3]]
* [[6-2]]
* [[3-2-2-2-3]]
* [[2-2-2-2-2-2]]
* [[TSR]]
* [[L7E]]
* [[WaterRoux]]
* [[Freestyle]] ([[Freestyle BLD]])
* [[4 pairs]]
* [[FOPP 1/4]]
* [[3D-Edg (pcms var2)]]
* [[Journey Method]] (for BLD)
* [[House Method]] (BLD)
* [[Story Method]] (BLD)
* [[Auditory Method]] (BLD)
* [[NISS]]
* [[Insertion]] (FMC technique)
* [[AbsoRoux]] (Roux on big cubes)

== Online Programs/Tools/Websites ==
* [[Groupifier]] (by Jonatan Klosko, posted on CF)
* [[CUBETimer]] (cubetimer.com)
* [[VideoTimer]]
* [[MinimalisTimer]]
* [[RubeTimer]]
* [[ImageCube]]
* [[NxNImagecube]]
* [[VisualCube]]
* [[Algorithm Translator]]
* [[NxMxL scrambler]]
* [[QBX]]
* [[Coracle]]
* [[Fantasy Cubing]]
* [[Cubecast Podcast]]
* [[Cubecast 2.0]]

== People ==
* [[Tony Fisher]]
* [[Tony Durham]]
* [[Eva Kato]]
* [[Myles Casanas]]
* [[Forte Shinko]]
* [[James Hildreth]]
* [[Thompson Clarke]]
* [[Corey Sakowski]]
* [[Alese Devin]] (JustKeepCubing)
* [[Sam Snodgrass]] (Cubey Time)
* [[Artur Kristof]] (Arcio)
* [[Deven Nadudvari]]
* [[Matt Rudnicki]]
* [[Arthur Adams]]
* [[Kavin Tangtartharakul]] (GuRoux)
* [[Callum Hales-Jepp]]
* [[Adam Polkowski]]
* [[Krzysztof Dąbrowski]]
* [[Marcin Jakubowski]]
* [[Kamil Pawlak]]
* [[Adam Joks]]
* [[Michał Bogdan]]
* [[David Adams]]
* [[Michał Burnicki]]
* [[Angel Lim]]
* [[Kalina Jakubowska]]
* [[Marcin Stachura]]
* [[Piotr Trząski]]
* [[Grzegorz Pacewicz]]
* [[Tristan Wright]]
* [[Piotr Frankowski]]
* [[Wojciech Szatanowski]]
* [[Piotr Kuchta]]
* [[Przyemysław Rogalski]]
* [[Hubert Hanusiak]]
* [[Robbie Villarica]]
* [[Karolina Wiącek]]
* [[Pavan Ravindra]]
* [[Ziheng Ma]]
* [[Yiwei Liu]]
* [[Walker Welch]]
* [[Sam Richard]]
* [[Damian Bias]] (Cubeologist)
* [[Dan Fast]] (CrazyBadCuber)
* [[Daniel Wannamaker]]
* [[Matthew Dickman]] (TehCubeDude)
* [[Haaris Jamil]] (ParadoxCubing)
* [[Sydney Weaver]]
* [[Bhargav Narasimhan]]
* [[Jiayu Wang]]
* [[Blake Thompson]]
* [[Alexander Carlier]]
* [[Andy Denney]]
* [[Joshua Feran]]
* [[Mark Boyanowski]]
* [[Justin Mallari]]
* [[Yi-Fan Wu]]
* [[Nathan Soria]]
* [[Éder dos Santos]]
* [[João Gabriel]]
* [[Daan Krammar]]
* [[Fabio Seiji]]
* [[Will Callan]]
* [[Gabriel Pitali]]
* [[Gustavo Penaforte]]
* [[Doug Li]]
* [[Sam Boyles]]
* [[Marlon Marques]]
* [[Pedro Santos]]
* [[Tommy Szeliga]]
* [[Nathan Dwyer]]
* [[Brandon Huang]]
* [[Henry Savich]]
* [[Rafael Cinoto]]
* [[Cyril Castella]]
* [[Guillaume Erbibou]] (Ofapel)
* [[Olivier Polspoel]] (Spols)
* [[Filippo Brancaleoni]]
* [[Jeong Jong-Ho]] or [[Jong-Ho Jeong]]
* [[Shivam Bansal]]
* [[Kit Clement]]
* [[Jeff Park]]
* [[Christian Pizzasegola]]
* [[Hilmar Magnusson]]
* [[Joel Spang]]
* [[Jonathan Irvin Gunawan]]
* [[Alex Maass]]
* [[Thomas Kaunzinger]]
* [[Ian Moore]]
* [[Lóreley Aiedail Tollaksdóttir Kuusisto]]
* [[John Li]] (Teoidus)
* [[Jacob Hutnyk]]
* [[Gabriel Alejandro Orozco Casillas]]
* [[Morten Arborg]]
* [[Cristian Leana]]
* [[Thomas Stadler]]
* [[Björn Korbanka]]
* [[Han-Cyun Chen]]
* [[Kailong Li]]
* [[Brayden Mossey]]
* [[Daan Kramer]]
* [[Shengliang Cai (蔡盛梁)]]
* [[Jonathan Cookmeyer]]
* [[Daniel Beyer]]
* [[Damjan Zagorec]]

== Products ==
* [[Martian Lube]] (Martian lubricant)
* [[Galaxy Lube]] (Galaxy lubricant)
* [[Nebula Lube]] (Nebula lubricant)
* [[Gravity Grip]]
* [[Z Lube]]

== Puzzle Types ==
* [[4D cubing]], [[3x3x3x3]], [[4D solving algorithms]] (by puzzle), [[higher dimensions cubing]]
* [[Helicopter cube]]
* [[Constrained cube (90°)]]
* [[Master Skewb]]
* [[Crazy 4×4×4 cube (version 1)‏‎]]
* [[Crazy 4×4×4 cube (version 2)]]
* [[Square-2‎]]
* [[Crazy 4×4×4 cube (version 3)]]
* [[Labyrinth cube]]
* [[Curvy Copter]]
* [[Shepherd's cube‏‎]]
* [[Rex cube‏‎]]
* [[Latch Cube]]
* [[Gear cube extreme‏‎]]
* All NxNxN puzzles (N=0,1,14,15,16,18,21,22,23,24,25,26,27,28,29)
* [[Golden Cube]]
* [[Smart Egg]]
* [[Pyracosaminx]]
* [[Icosaminx]]
* [[Super-X]]
* [[SwitchTiles]]
* [[Loopover]] (2D Rubik's cube)

== Software ==
* [[min2phase]]

== Subsets ==
* [[OLL-E]]
* [[OCE(P)LL]]
* [[WVCP]]
* [[L5EP]]

== Terminology ==
* [[Singmaster Notation]]
* [[SiGN]] notation
* [[Factory solve]]
* [[Washer]] (hardware)
* [[torpedo]]
* [[ball bearing]]
* [[brand]]
* [[Judge]]
* [[magnetic cube]]
* [[Per Special]]
* [[WCA Candidate Delegate]]
* [[Tension]] (tensions, tensioning)
* [[Cube state]]
* [[Sticker variation]]
* [[Catch]] or [[Catches]]
* [[Move]]/[[Turn]]
* [[Sticker]]
* [[Puzzle Hardware]]
* [[Last Slot]]
* [[Piece]]
* Cube states : [[LL:EO+EP cube state‏‎]], [[LL:EO+CO+CP cube state]] ...
* [[1gen]]
* [[5gen]]
* [[6gen]]
* [[feet (hardware)]]
* [[Case]] (as in "this OLL case")
* Weight 0.1 through 8
* [[brand]]
* [[L3C cube state]]
* [[3-cycle]]
* [[Square Group]]
* [[Timer]]
* [[F2L-1E (D) cube state]]
* [[5LLL]]
* [[Look]]s (as in 1LLL, 2LLL, 4LLL, etc.)
* [[15 puzzle]]
* [[Sum of Ranks]] (discuss both Sum of Average Ranks and Single Ranks)
* [[Sum of Average Ranks]]
* [[Sum of Single Ranks]]

== Other requests ==
* delete protected file <nowiki>[[File:Thomascharms1155.jpg]]</nowiki> (vandalism)
* fix all [[Special:DoubleRedirects]]

[[Category:Speedsolving.com Wiki maintenance]]

Talk:CML-Method

2020-02-07T18:58:23Z

ProStar:

==Proposers==

Was Marc Waterman involved in the creation of the method, or was his method used as inspiration? People who inspired the method shouldn't count as proposers, only the people that actually worked on it.

[[User:ProStar|ProStar]] ([[User talk:ProStar|talk]]) 18:55, 7 February 2020 (UTC)

==Method Steps Box==

CML is a method, not a step. The box that say "The CML-Method Step is the step between previous cube state and next cube state" should be removed.

[[User:ProStar|ProStar]] ([[User talk:ProStar|talk]]) 18:58, 7 February 2020 (UTC)

==Page Name==

The name of the page probably shouldn't be hyphenated, but instead "CML Method", as "method" isn't part of the actual method name

[[User:ProStar|ProStar]] ([[User talk:ProStar|talk]]) 18:58, 7 February 2020 (UTC)

Talk:CML-Method

2020-02-07T18:58:07Z

ProStar:

==Proposers==

Was Marc Waterman involved in the creation of the method, or was his method used as inspiration? People who inspired the method shouldn't count as proposers, only the people that actually worked on it.

[[User:ProStar|ProStar]] ([[User talk:ProStar|talk]]) 18:55, 7 February 2020 (UTC)

==Method Steps Box==

CML is a method, not a step. The box that say "The CML-Method Step is the step between previous cube state and next cube state" should be removed.

==Page Name==

The name of the page probably shouldn't be hyphenated, but instead "CML Method", as "method" isn't part of the actual method name

Talk:CML-Method

2020-02-07T18:55:25Z

ProStar: Created page with "==Proposers== Was Marc Waterman involved in the creation of the method, or was his method used as inspiration? People who inspired the method shouldn't count as proposers, on..."

CML-Method

2020-02-07T18:52:40Z

ProStar: CML isn't a step, it's a separate method. Removed "previous" & "next" steps

{{Substep Infobox
|name=CML Method
|image=
|proposers=Various, [[Marc Waterman]], Christoph Petsch, Tobias Petsch
|year=2020
|variants=[[Waterman Method]],[[Salvia Method]]
|subgroup=EML,PML
|algs=20-40
|moves=max. 60
|purpose=Speedsolving
}}

The CML-Method (Corner-Middle-Layer-Method) is a speedsolving method created in 2020. It's predecessor was the [[Waterman Method]], but CML uses far less algorithms and is effitiently enough to be a speedcubing method.

'''CML-Method in-depth'''
----

* Step 1: First Layer (Blockbuilding or LBL approach)
* Step 2: COCP-LL (Corner Orientation Corner Permutation Last Layer) (done on the last layer)
* Step 3: EML (Edge-Middle-Layer)
* Step 4: PML (Permutation-Middle-Layer)

'''EML'''
----
turn the solved side on the back and insert the remaining edges of the last Layer with U-Perms and F-Moves to insert them, use also S moves or do f moves for better move speed. Sometimes the edges are misoriented (bad egdes in this sense). For these bad edges do: ''' z' 2(M U M U) z '''. You can also correctly insert the edge directly by choosing one of the U-Perms.

'''PML'''
----
Permutation of the Middle layer is done by a set of 6 algorithms.
Only bad edges at the right position: '''R E' R B2 R' E R E B2 R2 E' '''

One bad edge and three have to be permuted. Hold the bad edge on the front left position and do for
clockwise: ''' U' F L F2 B U R' F' R F2 B' L' U F' '''
counterclockwise: ''' U F U' L F2 B R' F R U' F2 B' L' F' ''' sometimes you have to do then:
'''U2 R B' D R' B U2 D2 F' L D' F L' D2''' ( for diagonal orientation of the edges on the Middle layer)

in case of no bad edge, hold the right permuted edge also on the front left side and do:
clockwise: U R2 U' D B2 D'
counterclockwise: U' D B2 U D' R2

the last case is a swap of two parallel edges:
'''U2 R U' D F L2 D2 R2 B U' D R U2 B2'''

'''Pros'''
----
* nearly no cube rotations needed
* very fast blockbuilding in step 1
* step 3 can be optimized by some more specific algorithms
* can be used as a beginner speedcubing method
* not much algorithms 20 - 40 (if optimized)
* sub-20 is possible

'''Cons'''
----
* E-moves are not ergonomic
* can be slow on some cases
* a lot of practice is needed to be really fast with this method

Petrus-W

2020-02-07T18:01:14Z

ProStar:

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# Solve a [[2x2x2 block]] in the back of the cube
# Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# Fix the misoriented edges [[ZZ Method]] style on the cube (Edges oriented relative to where it belongs on the R,U and L layers)
# Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves the [[last layer]] and the Down-Front edge piece to be solved
# Solve the remaining 4 corners using [[COLL]]
# Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
# If you can look into the 2x2x3 block in inspection, no cube rotations are required
# You can orient 4 edges at a time, instead of being restricted to the 2 allowed in [[Petrus]]
# You can use M' U' M to orient edges unlike in [[Petrus]] or [[ZZ]]
# [[F2L]] has less regrips than in [[Petrus]] [[F2L]]

==Cons==
# Unlike in the [[ZZ]] method, you cannot look into EO during inspection time
# L5EP has 7 more algorithms than EPLL
# Unlike in [[Petrus]] or [[ZZ]], you cannot use [[ZZLL]] or [[ZBLL]] to complete the [[Last Layer]] in one look
==History==
This method was proposed by Speedsolving.com member WarriorCatCuber in the ‘New Method/Substep/Concept Idea Thread.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Petrus-W

2020-02-07T18:00:57Z

ProStar:

{{Method Infobox
|name=Petrus-W
|image=
|proposers=WarriorCatCuber
|year=2020
|algs=1-58 (for the last layer corners and last 5 edges)
|anames
|variants=[[Petrus]]
|steps=6
|moves=47
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}
The '''Petrus-W Method''' is a method for solving the [[3x3x3 cube]] which was invented by WarriorCatCuber in 2020. The method is a variant on the [[Petrus]] method and is efficient enough to be used for advanced speedsolving.

==Steps==
The steps are as follows:
# Solve a [[2x2x2 block]] in the back of the cube
# Expand the [[2x2x2 block]] into a [[2x2x3 block]], also on the back of the cube
# Fix the misoriented edges [[ZZ Method]] style on the cube (Edges oriented relative to where it belongs on the R,U and L layers)
# Solve the final two [[Pair|corner-edge pairs]] while only using R, U and L moves to preserve [[EO]]. This leaves the [[last layer]] and the Down-Front edge piece to be solved
# Solve the remaining 4 corners using [[COLL]]
# Permute the final five edges with [[L5EP]] as in [[Portico]]

==Pros==
# If you can look into the 2x2x3 block in inspection, no cube rotations are required
# You can orient 4 edges at a time, instead of being restricted to the 2 allowed in [[Petrus]]
# You can use M' U' M to orient edges unlike in [[Petrus]] or [[ZZ]]
# [[F2L]] has less regrips than in [[Petrus]] [[F2L]]

==Cons==
# Unlike in the [[ZZ]] method, you cannot look into EO during inspection time
# L5EP has 7 more algorithms than EPLL
# Unlike in [[Petrus]] or [[ZZ]], you cannot use [[ZZLL]] or [[ZBLL]] to complete the [[Last Layer]] in one look
==History==
This method was proposed by Speedsolving.com member WarriorCatCuber in the ‘New Method/Substep/Concept Idea Thread.

== See also ==
* [[Petrus Method]]
* [[ZZ Method]]
* [[Portico]]

== External links ==
*[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-282#post-1348617/ Original proposal]
*[https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA/edit#gid=519357026/ L6EP document containing L5EP algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]