Speedsolving.com Wiki - User contributions [en]

PEG

2013-07-11T17:32:27Z

Wikube7:

The '''PEG''' method (''pairs + Erik + Gunnar'') is based off of [[Erik Akkersdijk]]'s and [[Gunnar Krig]]'s [[2x2x2]] method [[EG]], but has been moved over to [[3x3x3]]. Here, not only the corners of the first layer are oriented as the first step, but also all the [[pair]]s are. So it will be Pairs-EG or simply PEG!

PEG differs slightly from EG. Most algorithms can be used if some of the turns are done double layer to preserve the pairs. But some algorithms destroy the pairs no matter how they are performed. In those cases, other, possibly longer algorithms need to be used.

Example: This algorithm solves [[CxLL Pi D#EG|EG 1 Pi D]]
* R U R' L' U' L R U R'

To use it for PEG, do it like this:
* R U R' l' U' L r U R'

PEG is best used together with [[L5E]].

PEG is also useful for direct solving big cubes. The only difference is that the "pairs" have more edges and you need to do triple, quadruple, etc. layer turns to preserve them while doing EG.

This method can be divided into three groups: PEG 0, PEG 1, and PEG 2, where the number is the number of pairs correctly placed in F2L. If two adjacent pairs are swapped, it is PEG 1 (two pairs connected). If two diagonal pairs are swapped, it is PEG 0 (no pairs connected). Finally, if all pairs are correct, it is PEG 2 (4 pairs connected).

PEG 2 is a stand-alone method where you use a standard [[CxLL]] (CMLL, or rather CMSLL, because the S-slice is also free).

A beginner / stepping stone method that divides PEG into two steps is [[PORT]]. This is the same as [[Ortega]], except it preserves pair orientation (but not permutation), rather than only [[FL]] corners.

==See also==
* [[PCMS]]

[[Category:3x3x3 methods]]
[[Category:Experimental methods]]

[[Category:Acronyms]]

Heise method

2013-07-09T21:26:46Z

Wikube7:

{{Method Infobox
|name=Heise
|image=Heise_method.gif
|proposers=[[Ryan Heise]]
|year=2003
|anames
|variants
|steps=4
|algs=0
|moves=40-
|purpose=
* [[Fewest Moves]]
* [[Speedsolving]]
}}
The '''Heise Method''', invented by [[Ryan Heise]], is a intuitive [[method]] which requires no [[algorithm]]s. It uses extremely few moves, but it may be difficult to get fast times using this method.

==The Steps==

1. Create four 1x2x2 blocks, making sure that one color appears on none of the blocks. This color will be the color of the last layer. Note that these blocks do not necessarily have to be paired together when they are built. One of these blocks should be just two centers and an edge.

2. Pair up the 1x2x2 blocks, while simultaneously orienting the last-layer edges. Note that you will now have all of F2L minus a corner/edge pair finished.

3. Create two corner-edge pairs, and then solve all of the edges and two corners. This is typically a very difficult step for beginners to solve.

4. Solve the final three corners with a commutator.

==Pros==

This method is more efficient than any of the main three speedcubing methods, and therefore it's also very good for fewest moves solving. Because there are no algorithms at all, users of this method generally become very good at intuitive blockbuilding and develop a high-level understanding of the cube.

==Cons==

Every turn has to be planned out because there are no algorithms, so fast turners will be disappointed. Some of the steps, especially the third step, can be very difficult to get used to, and beginning cubers might not understand enough cube theory to be able to use this method at all.

==External links==

* [http://www.ryanheise.com/cube/heise_method.html Ryan Heise's tutorial]

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

Layer by layer

2013-07-09T21:21:15Z

Wikube7:

{{Method Infobox
|name=LBL (3x3x3)
|image=Layer_by_layer.gif
|proposers=none
|year=1980s
|anames
|variants=[[CFOP]], [[8355]]
|steps=5+
|algs=6 to 16 (depending on [[LL]])
|moves
|purpose=
* [[Beginner method]]
* [[Speedsolving]]
}}
'''Layer-By-Layer''', or normally only '''LBL''' is a group of [[method]]s that solves the [[cube]] in layers. In the basic, [[3x3x3 beginner methods#Layer By Layer|beginner LBL method]], the solver finishes the layers one at a time: the [[first layer]] edges, then corners, then the second layer edges, and finally the [[last layer]]. This is the most common method for new cubers to discover on their own. In more advanced LBL methods, you solve layers more efficiently or solve two layers at once. For example, in the [[Fridrich method]], one solves the [[first two layers]] simultaneously by forming a [[cross]] of the first layer [[edge]]s, and then filling in four [[pair]]s of a [[corner]] and an [[edge]] into the so-called [[slot]]s.

__NOTOC__
 
== 3x3x3 LBL Method ==
Also known as LBL. Solves the cube in layers: First the bottom layer, then the middle layer, and finally the top layer or [[LL]]. As a slight advancement to basic Layer By Layer, the [[Keyhole]] method can be used to enable solving of the middle layer in fewer moves.

== 2x2x2 LBL Method ==
{{Method Infobox
|name=LBL (2x2x2)
|image=Lbl.gif
|proposers=none
|year=1980s
|anames
|variants=[[CLL]]
|steps=3
|algs=2 to 9 (depending on [[LL]])
|moves
|purpose=
* [[Beginner Method]]
* [[Speedsolving]]
}}

Done as if solving the 3x3 corners using the Layer-By-Layer method. You can use shorter last layer algs because there are no edges that need to be kept in position on a 2x2. You can use any OLL of your choice as long as the corners are in the correct position. There are two options for the last layer in a beginner 2x2 solve:

* Orientation followed by Permutation
* Permutation followed by Orientation

==See also==
* [[LOL]]
* [[OLL]]
* [[PLL]]
* [[OLL (2x2x2)]]
* [[Layer]]
* [[First Layer]]
* [[Last Layer]]
* [[4-Look Last Layer]]

== External links ==
* YouTube: [http://www.youtube.com/user/CubeRight#p/u/8/VVrOmmKnVjo CubeRight's] excellent (HD) beginner tutorial. Easy transition to Fridrich method.
* YouTube: [http://www.youtube.com/watch?v=609nhVzg-5Q Badmephiosto's Beginners Tutorial] excellent quality tutorial. Method designed for easy transition to Fridrich
* YouTube: [http://ca.youtube.com/watch?v=ofZFUgaxlTQ Badmephisto's OLD Beginners Tutorial] .. the outdated version.
* YouTube: [http://www.youtube.com/watch?v=HsQIoPyfQzM Dan brown's Beginner Method] combines corner orientation/permutation into one step making the solve a little easier, but much slower and more difficult to transition to Fridrich
* [http://www.rubiksplace.com Beginners solution with animations] Excellent tutorial at www.rubiksplace.com
* [http://www.monkeysee.com/play/1113-solve-rubik-s-cube Bob Burton's Tutorial] (video)
* [http://www.rubiks.com/Academy/Tyson%20Video.aspx Tyson Mao's video tutorial on rubiks.com] (video)
* [http://www.stanford.edu/~leyanlo/cube_solution.pdf Leyan's guide for beginners] '''(PDF)'''
* [http://peter.stillhq.com/jasmine/rubikscubesolution.html Jasmine Lee's Beginner Solution]
* [http://www.kungfoomanchu.com/#333beginners A 9 algorithm beginner's guide] (A printable PDF that gives you the algs necessary to solve the cube, but lets you figure out how to use them)
* [http://erikku.110mb.com/beginner.html Arnaud van Galen's beginners method explained by Erik Akkersdijk]
* [http://rubikscube.info/beginner.php rubikscube.info Beginner LBL for the 2x2x2]
* [http://joshtime.com/cubing/beginners-method/ JoshTime's Multiple Page LBL Beginner's Method Explanation]

[[Category:2x2x2 beginner methods]]
[[Category:3x3x3 beginner methods]]
[[Category:2x2x2 speedsolving methods]]
[[Category:3x3x3 speedsolving methods]]

CLS

2013-07-09T21:16:01Z

Wikube7:

{{Method Infobox
|name=CLS
|image=CLS.png
|proposers=[[Shotaro Makisumi]] [[Lucas Garron]]
|year=2006
|anames
|variants=
|steps=1
|algs=104
|moves
|purpose=
* [[Speedsolving]]
}}

'''CLS''' (short for '''Corners Last Slot''') is a sub-step of the [[MGLS]] method. In it, you orient all LL corners while simultaneously placing the last F2L slot corner.

There are six groups of cases, depending on the position and orientation of the last slot F2L corner. 
C: correctly oriented in slot (7 cases - OLL cases where edge orientation is correct) 
I: oriented clockwise in slot (8 cases) 
Im: oriented counter-clockwise in slot (8 cases) 
+: oriented clockwise in U-layer (27 cases) 
-: oriented counter-clockwise in U-layer (27 cases) 
O: correctly oriented in U-layer (27 cases) 

== External links ==

* [http://www.cubefreak.net/speed/mgls/index.html Macky's CLS pages]
* [http://cube.garron.us/MGLS/ Lucas's CLS pages]

[[Category:3x3x3 last slot substeps]]

SS Method

2013-07-09T21:14:30Z

Wikube7:

{{Method Infobox
|name=SS
|image=Ss_method.gif
|proposers=[[Mitchell Stern]], [[Timothy Sun]]
|year=2008
|anames=SternSun method
|variants
|steps=3
|algs=109
|moves
|purpose=
* [[Speedsolving]]
}}
The '''SS method''' (short for '''Stern-Sun''') is a 2x2 method invented by [[Mitchell Stern]] and [[Timothy Sun]] in 2008.

The SS method has three steps. In the first step, solve 3/4 of a face. In the second step, finish the face while simultaneously orienting the opposite face. Finally, permute both layers at once. Without counting reflections, there are 60 algorithms, including the 5 [[PBLs]]. Including reflections, it comes to 109 algorithms.

== Trivia ==
"Stern" is the German word for star, making SS the "Star-Sun" method.

== See also ==
* [[CLS]]

== External links ==
* [http://cube.garron.us/2x2x2/SS/SS_0_1.pdf SS Algorithm Sheet]
* [http://dtwoner.110mb.com/index.php?p=1_49_SS SS Algorithms at OMFG COLORS!]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=23922 SS Method]
* [http://amvhell.com/stuff/cubes/SubSS/SubSS.html SubSS]
* [https://docs.google.com/leaf?id=0B1HP6i5J4mf9YTczZmY5ZTgtOTM0Zi00NDg1LWIzNDEtNWEwYTc3ZmExOTFl&hl=en_US SS Method Algorithms Word Doc]

[[Category:2x2x2 methods]]
[[Category:2x2x2 speedsolving methods]]

SOAP Method

2013-07-09T21:12:27Z

Wikube7:

{{Method Infobox
|name=SOAP
|image=Soap.gif
|proposers=[[Justin Jaffray]]
|year=2009
|anames
|variants=SS
|steps=3
|algs=58 Total 53 Orientation 5 PBL
|moves=18
|purpose=
* [[Speedsolving]]
}}

The '''SOAP Method''' is a 2x2 speedsolving method invented by [[Justin Jaffray]] in 2009. The letters stand for '''S'''eparate, '''O'''rient '''A'''ll, '''P'''ermute. There are three steps. First, separate two opposite colours into opposite layers and build half a face on the bottom. Next, orient the all pieces using one of 53 algorithms. Finally, permute both layers. ([[PBL]]).

It is possible to perform all of the orientation algs 2-gen, although many of them are not optimal. A unique property of this method is that when using 2-gen algs, it becomes very easy to predict the PBL, which means that you can often solve the cube in 1 look.

== See also ==
* [[SS Method]]
* [[Ortega Method]]

== External links ==
* [http://spreadsheets.google.com/pub?key=tLBVarBM6YVltzQfS4-eSgw&output=html Algs for Orientation Step]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=16237 SOAP 2x2 Method]
* [http://amvhell.com/stuff/cubes/SOAP/SOAP.html SOAP Method Tutorial and algs]

[[Category:2x2x2 methods]]
[[Category:2x2x2 speedsolving methods]]

{{Stub}}

PCMS

2013-07-09T21:08:18Z

Wikube7:

{{Method Infobox
|name=PCMS
|image=Columns_first.gif
|proposers=[[Kenneth Gustavsson]]
|year=2008
|anames=KC (Kenneth's Columns)
|variants=[[Columns first]], [[Roux]], [[CF]]
|steps=2 mayor, 2+3 sub steps
|algs=63
|moves=Less than 50 [[STM]]
|purpose=
* [[Speedsolving]]
}}

'''PCMS''' (pairs, CLL, M and S slices) is an advanced method for [[speedsolving]] using [[columns first]], designed by [[Kenneth Gustavsson]] in late 2008. The method compromises between easy [[look ahead]] and low [[move count]] ([[STM|slice metric]]), and the result is 'decent' for both parts. The first two steps of PCMS leave the cube in a very similar state to the first two steps of Roux method.

'''Steps:'''
# Columns:
## Solve 4 [[CE pair]]s using intuition.
## CMSLL (42 algs), something between 2x2 CLL and CMLL (see [[CxLL]]).
# Slices:
## Solve [[centre]]s and the RD, LD and BD edges using intuition (3x centre/edge pairs actually).
## [[L5E]], last five edges, solve the FD edge and the [[LL]] edges in two short alg steps.
### L5EO, orientation (5 algs minumum but here you can add more to force easier permutations).
### L5EP, permutation (16 algs).

==Starting the solve==
As do most cubers, I usually start from the same side/colour, but if there is one (or more) pair completed in the opposite colour from the scramble, then I use that side. When doing so I only solve columns opposite. These are bi-directional so you just need to turn the cube up-side-down before the slices are solved and you can go into your normal colour from there.

'''Inspection''' - this is the key to success. Be able to predict the turns for solving 2-3 pairs and you will get good times.

Looking ahead for pieces of the pairs while turning is the slowest part of this method, so it really pays to be good at predicting the turns. Use what you have. In some scrambles two corners are solved next to each other. In this case, pair the edges on the opposite side and then put the corners there using D2 (or use a solver to find algs to put them in directly from some easy to set up to positions).

If you cannot see an easy pair from start, do not randomly scan the cube for pieces, rather, disregard certain pieces. There are nine permutations for the edge that all need three moves to be solved. The rest of the positions are two, or possibly even one move to solve. If the corner is oriented in D as in the the image below, and the edge is sitting in one of the darker positions, (assuming it is not solved), then it is a bad pair. All these positions are near the corner, so you can see it pretty easily and then ignore that corner and pick another one.

:[[File:PCMS bad pairs.jpg]]

The bad pairs.

You will soon learn to recognize the rest of the positions, three of which only require a D (or u) move to pair up. The last group that requires two moves consists of eleven different cases. Being able to quickly find the first pair leaves enough inspection time to find at least one more, possibly even two.

==Pairs==
The move count is dependent on how well you solve the first step. If you look ahead further and create more than one pair before you start to place them, you can make as low as 10 turns for all four pairs sometimes. It is even possible to solve in under 45 moves on average, but not while speedcubing. A low move count is not as important as making sure to not re-grip while solving the pairs. This is the part where you can gain speed in this step. For example, place a pair using '''U Rw U R'''' rather than '''(y') R' U R'''. This avoids cube rotations. Making 15-17 turns while speedcubing is normal.

Pairing up is done a bit differently than in [[F2L#Fridrich F2L|Fridrich F2L]]. First, find a pair, preferably one where the corner is unoriented in the U-layer, and the edge is in the D-layer. If the edge is not there, then one in the U-layer is a second choice because it is easy to place in the D layer using a single slice move. Orient the cube so that the edge is in FD or BD position, and move the corner into position using a U move. Then pair the two pieces using the M-slice. For the pairs where the corner or the edge is in bad position, you have to do some setup moves to fix that, or simply use the CFOP alg for the same pair.

'''Example:'''

Scramble:
{{Scramble 3x 01}}

* p1; pieces are good, just do '''M2''' to pair up and '''(z)''' to place.
* p2; because only one pair is solved here we can do the next from bottom and up, like this: '''U L2''' to pair and '''R' U (x)''' to place it.
* p3; nice corner, edge in U-layer so setup that one first using '''(y) M'''' then '''U M2''' to pair up and '''U2 B'''' to place it (temporarly move the B-side to U before the B turn).
* p4; both pieces in position so: '''(y) U2 M2''' to pair up and '''U R' U2 R''' to place.

16 moves not counting puzzle rotations, pretty normal.

''At bottom of this page you can find some more examples.''

==CMSLL==
'''CMSLL''' is pretty much the same as CLL for 2x2x2 (or [[CF]]) but in some cases you need to use double layer turns to preserve the pairs, for example '''R U' R' U' F' U F''' becomes '''R U' Rw' U' F' U F'''. In cases where that does not work any alg optimal for [[CMLL]] will do fine but with the advantage that you don't have to [[AUF]] the case so it fits with the empty M-slice, here the S-slice is equally good to use.

Algs and all cases you can find at the [[CxLL|CxLL pages]].

'''Example:'''

If we continue from the example for the pairs, then this case is [[Sune]] :P

*'''(y2) R U R' U R U2 R'

Try to look for edges to solve in the next comming step while executing the CLL alg. Advanced it is possible to solve some from inserting slice moves in the CLL, like if it is Sune: R U R' U (M) R U2 R'

==Slices==
The first part of the second half of the solve is all intuitive, you pair one first layer edge with it's centre and then place it into position. After some parctice this is really easy, no thinking required. It is possible to create more advanced methods than this and use algs for some parts but that is not a good idea, it would only kill the easiness and speed for this part of the solve.

'''Example:'''

''(Continued from above)''

* p1; '''U' M'''' to pair '''(y) M'''' to place.
* p2; paired! '''M' U2 M''' to place.
* p3; paired again, '''(y') U2 M'''' to place.

Note that you can solve the third pair before the second using only one move, which would save one U2 but add two cube rotations ((y') p2 (y) p3 (y') L5EO). I usually solve the edge opposite to the first as the second one just to avoid rotations. I think that it is faster on average, especially if you look for that edge while solving the first one. If it is stuck in the D layer, then try to find one edge that faces to the side in the U layer instead. Then the same thing applies: solve the edge opposite to the second as the third to avoid rotations.

'''L5E''': ''(dunno what name I used at first but it will be L5E from here, that to stick to cubing vocabulary standards =)''

'''Example:'''

''(Continued from above)''
* L5EO; '''U' M' U' M U M' U' M''' to orient and place FD edge.
* L5EP; [[U-PLL]]

See [[L5E]] for description and algs.

You only need five algs for orientation, but it is a good idea to learn as many as possible that also solve the FD edge. This has two reasons: First is that you can recognize [[EPLL]] faster than L5E permutations. (The 5-cycles are particularly slow.) The second reason is that you get an EPLL skip 1:12 times. For five oriented edges that number is 1:60.

'''Note'''; after I wrote this article I have completed [[L5EOP]], which is the method I mostly use and also did in the examples of this page.

===ELL?===
If you don't like L5E or already know [[ELL]], it is possible to end the solve by also putting down the last D-layer edge in the same manner as the other three, and then end in ELL. But I do not recommend it, because recognition of ELL is slow. L5E is faster on average, and you may save a few moves, but it doesn't make up for it.

However, as an extension to PCMS, ELL is the first thing to think of because sometimes you skip the last edge while solving the third one and in some cases it was already skipped from start and you did not see that, so you end up having an ELL. You can still solve all ELL's using L5E, and in some cases even more optimally, but there are good cases in ELL that you would miss.

==Summary==
The first half of this method, columns, is much harder to master than the slice part, which can be learned fairly easy. Learning CLL can take some time. The algs are not that hard, but the recognition can be. That also applies to solving the pairs in the start. Look ahead is harder than in CFOP because there are more places to look for the edges (D layer).

So, the first steps are where you need to put in more effort if you want to use this method for speedsolving. Expect many pauses before it starts to get fluid. The second part, on the other hand, is where the fun begins, especially if you are good at MU-style algs. Most of these algs are short, and case recognition is quick. Sometimes it is hard to keep up in the rapid phase. Occasionally a piece becomes solved and you don't know how :D

===See also===
* [[PEG]]
* [[PORT]]
* [http://sites.google.com/site/kubbuth/columns-first PCMS at Kenneth's Swedish cube page]

==More examples==
Scramble:
{{Scramble 3x 02}}

'''Inspection:''' One pair (orange/blue) is doable using a single M' but we like to find some more to do before we start. If we think we solve that first pair and also reorient using (z'), then the orange/green is in fine position, it needs a U' and a M to be paired and is then easily placed. Now inspection time is running out so we are pleased with that...

* p1; '''M' (z')''' as planned.
* p2; '''U' M''' as planned, then '''U2 L' U (x')''' to place.
* p3; then we find a red/green corner in front of the eye and the edge is right under it so '''U' M'''' to pair up and '''Rw U R'''' to place.
* p4; this last pair is looking bad but is not that hard, first orient the cube '''(y)''' and then '''R U' M2''' to pair up and '''U R'''' to place.

16 STM again, as said, it's the normal.

'''CLL''' is mirror diagonal Sune, I'm using the usual Sune + inserts for this one, a [[COLL]] actually.
* '''L' U' L U' (R U') L' (U R') U2 L''' inserts in parentesis.

'''Slices:'''
* p1; '''M'''' to pair and then reorient before placement '''(y) U2 M''''
* p2; the opposite to the first is stuck in D so next will be orange; '''(y) U M' U' M'''.
* p3; bad, but; '''(y') M' (y') M' U M (y) M''' the last turn will go back up again in orientation but trying to see that while going does not work well.
'''Last five edges:'''
* L5EO; '''M' U M U2 M' U' M''' orients edges and permutes the FD edge.
* L5EP; [[H-PLL]]
----
Scramble:
{{Scramble 3x 03}}

'''Inspection:''' No solved pairs and no one move pairs in the D colour so let's look if there is any in the opposite colour and yes, the red/blue one is one turn. Orient the puzzle so it comes to solving position for that pair (x' y') and quickly look if there is one more... red/green will do, it is two moves to pair up:

* p1; '''D''' as planned.
* p2; '''B' M2''' as planned, (temp tilt the B-side to U) then '''U2 R' U (x)''' to place.
* p3; fine, already paired and easy to place; '''U' L'''.
* p4; corner oriented in U, I use an alg for this one but first I need to set up the edge, AUF and orient the puzzle; '''M' U2 (y') -- L' U2 L2 F' L' F''' ... Yeha, I'm lefty.

16 STM, a little luck and a long pair in the end made it an average solve, expect the last pair to use more turns than the rest, often it is not easier to solve here than in normal F2L.

'''CLL''' is bars [[Bruno]], I use a COLL also for this one, a combo of [[Niklas]] and [[Sune]].
* '''(y) R' U L U' R U' L' U' L U' L'''' ... lefty alg again =)

'''Slices:'''

Now, because I solved in the opposite colour from start I AUF and turn the puzzle up-side-down before I start the second half of the solve; '''U' (x2)'''
* p1; orange in front, centre in back so; '''U2 M U (y) M'''''
* p2; skipped!.
* p3; '''(y') M U' M'''' easy =)

'''Last five edges:'''
* L5EO; '''U M' U M''' the finest case.
* L5EP; [[Z-PLL]]

That one was pretty nice, easy cases in the end, as it often is using this method.

[[Category:3x3x3 methods]]
[[Category:Experimental methods]]

PEG

2013-07-09T20:17:33Z

Wikube7:

'''PEG''', ''pairs + Erik + Gunnar'' or [[Erik Akkersdijk]] and [[Gunnar Krig]]'s [[2x2x2]] method [[EG]] but moved over to [[3x3x3]]. Here, not only the corners of the first layer are oriented as the first step, but also all the [[pair]]s are. So it will be Pairs-EG or simply PEG!

PEG differs slightly from EG. Most algorithms can be used if some of the turns are done double layer to preserve the pairs. But some algorithms destroy the pairs no matter how they are performed. In those cases, other, possibly longer algorithms need to be used.

Example: This algorithm solves [[CxLL Pi D#EG|EG 1 Pi D]]
* R U R' L' U' L R U R'

To use it for PEG, do it like this:
* R U R' l' U' L r U R'

PEG is best used together with [[L5E]].

PEG is also useful for direct solving big cubes. The only difference is that the "pairs" have more edges and you need to do triple, quadruple, etc. layer turns to preserve them while doing EG.

This method can be divided into three groups: PEG 0, PEG 1, and PEG 2, where the number is the number of pairs correctly placed in F2L. If two adjacent pairs are swapped, it is PEG 1 (two pairs connected). If two diagonal pairs are swapped, it is PEG 0 (no pairs connected). Finally, if all pairs are correct, it is PEG 2 (4 pairs connected).

PEG 2 is a stand-alone method where you use a standard [[CxLL]] (CMLL, or rather CMSLL, because the S-slice is also free).

A beginner / stepping stone method that divides PEG into two steps is [[PORT]]. This is the same as [[Ortega]], except it preserves pair orientation (but not permutation), rather than only [[FL]] corners.

==See also==
* [[PCMS]]

[[Category:3x3x3 methods]]
[[Category:Experimental methods]]

[[Category:Acronyms]]