Speedsolving.com Wiki - User contributions [en]

PBL

2016-12-29T16:03:21Z

EastsheenFan: That should have been an L (thanks Cuc for pointing this out on the talk page)

'''Permutation of both layers''', abbreviated as '''PBL''', is a [[step]] used in a number of [[2x2x2]] methods (and thus [[corners first]] methods). Specifically, the [[Ortega method]] and the [[Guimond method]], perhaps the two most popular advanced [[2x2x2]] methods, both finish with a PBL step. When solving only corners, PBL has five unsolved cases, which can be recognized by the number of pairs on each side that are correctly permuted (a solved side has 4 pairs, an adjacent swap has 1 pair, and an opposite swap has 0 pairs), so the unsolved cases are 0+0, 1+0, 1+1, 4+0, and 4+1. [[Algorithm]]s for PBL (for 2x2x2 or CF) can be found at the [[Template:CxLLnav|CxLL]] pages (the grey cases in the topmost line).

It is actually possible, in theory, to do PBL in one step for [[3x3x3]] or [[Square-1]] - in this case we would be permuting not only corners but the whole layers. No [[speedcubing]] method actually uses this, though, because there are about 800 cases in total and recognition is very difficult. For the [[Square-1]], many methods do PBL in two steps, by first solving the [[corner]]s of both layers and then doing the [[edges]] of both layers. Even though two layers are being permuted at once, though, solvers conventionally refer to the steps as simply [[CP]] and [[EP]].

== Algorithms ==
<table cellspacing='5' cellpadding='5'><tr>
<td valign='top'>
==== Swap UF Corners ====

[[Image:PBL1.gif]]
* y' x U2 R' U' R U2 L' U R' U' R2
* (R' F R') B2 R F' (R' B2 R2) ([[PLL#A_Permutation_:_a|A Permutation]])
* U' x' R2 U2 R' U' R U2 L' U R'
* y' R2 F2 R' U' R F2 R' U R'
* y' (U') R' U L' U2 R U' R' U2 R L
* y' R U R' U' R' F R2 U' R' U' R U R' F' ([[PLL#T_Permutation_:_t|T Permutation]])
* y' R U2 R' U' R U2 L' U R' U' L
* y2 R' U L' U2 R U' R' U2 R2 B' (Ja Permutation)

</td>

<td valign='top'>
==== Swap U-Layer Diagonal ====
[[Image:PBL2.gif]]
* (R U' R' U') F2 (U' R U R') D R2
* (R U' R' U') F2 (U' R U R' U) F2
* L' U L D R2 D R' U' R D' R2
* F R U' R' U' R U R' F' R U R' U' R' F R F' ([[PLL#Y_Permutation|Y Permutation]])
* R' U L' U2 R U' x' U L' U2 R U' L
* [R' U R' U'] y [R' F'] [R2 U' R' U] [R' F R F]
</td>

<td valign='top'>
==== Swap UF + DF Corners ====
[[Image:PBL3.gif]]
* R2 U' R2' (U2' + y) R2 U' R2'
* R2' U' R2 U2' F2 U' R2
* R2' U' R2 U2' x' U2 x' U' R2
* R2 U F2 U2 R2 U R2
* y2 R2 U' B2 U2' R2' U' R2
* z' U2 L U2 (L' R') U2 R U2
</td>

</tr>
<tr>

<td valign='top'>
==== Swap U + D Diagonal ====
[[Image:PBL4.gif]]

* R2' F2 R2
* R2 B2 R2'
* (R L) U2 (R' L')
</td>

<td valign='top'>
==== Swap UB Corners + D-Layer Diagonal ====
[[Image:PBL5.gif]]

* [R U' R] F2 [R' U R']
* [R U' L] U2 [R' U R']
* y2 [R' U L'] U2 [R U' L]
* x2 y' R2 U' R2 U R2 U' R2 U R2
* z2 R D' L U2 L' D R'
* x2 R D' L U2 R' F U'
</td>

<td valign='top'>
==== Swap UB + DB Corners ====
[[Image:PBL6.gif]]
* R2 U' B2 U2' R2' U' R2
* R2 U R2 U2 F2 U F2
* R2' U R2 U2 y' R2' U R2
* L2' U F2' U2 R2' U R2'
</td>

</tr>
</table>

The first two algorithms (Y perm and A perm) only affect the top layer, and because of that, they can be used in LBL methods.

Note that D moves are the same as U + y, just a different notation, what you do for real is something in between. The effect of it is that you transform F moves to R or L (D R makes the same turns as U F + y').
== See also ==
* [[Ortega]]
* [[Guimond]]
* [[OLL (2x2x2)]]

== External links ==
* [http://dtwoner.110mb.com/index.php?p=1_40_PBL David Woner's PBL algs]
* [http://www.cubewhiz.com/ortegapbl.php Bob Burton's PBL algs]

[[Category:2x2x2 substeps]]
[[Category:Algorithms]]

[[Category:Acronyms]]
__NOTOC__
__NOEDITSECTION__

Talk:PBL

2016-12-29T16:01:31Z

EastsheenFan: /* Swap UF Corners */

==Swap UF Corners==
The formula R U2 R' U' R U2 L' U R' U' L' is wrong. Can anybody correct it? It's probably a typo, but I can't reconstruct it. [[User:Cuc|Cuc]] ([[User talk:Cuc|talk]]) 18:14, 23 December 2016 (UTC)
:The algorithm is correct but it swaps the UR corners, not the UF corners. I've added a ''y''' rotation to show this. [[User:EastsheenFan|EastsheenFan]] ([[User talk:EastsheenFan|talk]]) 13:34, 24 December 2016 (UTC)
::I performed it on a regular cube and I noticed that the last L' should be replaced by an L. I am sorry that I did not see this on a 2x2 at once. Please, verify. And yes, the y' helps too :-) [[User:Cuc|Cuc]] ([[User talk:Cuc|talk]]) 05:57, 26 December 2016 (UTC)
:::Oh yes, you're right; that should indeed be an L. I didn't notice that! [[User:EastsheenFan|EastsheenFan]] ([[User talk:EastsheenFan|talk]]) 16:01, 29 December 2016 (UTC)

Talk:PBL

2016-12-24T13:34:38Z

EastsheenFan: /* Swap UF Corners */

PBL

2016-12-24T13:34:28Z

EastsheenFan:

'''Permutation of both layers''', abbreviated as '''PBL''', is a [[step]] used in a number of [[2x2x2]] methods (and thus [[corners first]] methods). Specifically, the [[Ortega method]] and the [[Guimond method]], perhaps the two most popular advanced [[2x2x2]] methods, both finish with a PBL step. When solving only corners, PBL has five unsolved cases, which can be recognized by the number of pairs on each side that are correctly permuted (a solved side has 4 pairs, an adjacent swap has 1 pair, and an opposite swap has 0 pairs), so the unsolved cases are 0+0, 1+0, 1+1, 4+0, and 4+1. [[Algorithm]]s for PBL (for 2x2x2 or CF) can be found at the [[Template:CxLLnav|CxLL]] pages (the grey cases in the topmost line).

It is actually possible, in theory, to do PBL in one step for [[3x3x3]] or [[Square-1]] - in this case we would be permuting not only corners but the whole layers. No [[speedcubing]] method actually uses this, though, because there are about 800 cases in total and recognition is very difficult. For the [[Square-1]], many methods do PBL in two steps, by first solving the [[corner]]s of both layers and then doing the [[edges]] of both layers. Even though two layers are being permuted at once, though, solvers conventionally refer to the steps as simply [[CP]] and [[EP]].

== Algorithms ==
<table cellspacing='5' cellpadding='5'><tr>
<td valign='top'>
==== Swap UF Corners ====

[[Image:PBL1.gif]]
* y' x U2 R' U' R U2 L' U R' U' R2
* (R' F R') B2 R F' (R' B2 R2) ([[PLL#A_Permutation_:_a|A Permutation]])
* U' x' R2 U2 R' U' R U2 L' U R'
* y' R2 F2 R' U' R F2 R' U R'
* y' (U') R' U L' U2 R U' R' U2 R L
* y' R U R' U' R' F R2 U' R' U' R U R' F' ([[PLL#T_Permutation_:_t|T Permutation]])
* y' R U2 R' U' R U2 L' U R' U' L'
* y2 R' U L' U2 R U' R' U2 R2 B' (Ja Permutation)

</td>

<td valign='top'>
==== Swap U-Layer Diagonal ====
[[Image:PBL2.gif]]
* (R U' R' U') F2 (U' R U R') D R2
* (R U' R' U') F2 (U' R U R' U) F2
* L' U L D R2 D R' U' R D' R2
* F R U' R' U' R U R' F' R U R' U' R' F R F' ([[PLL#Y_Permutation|Y Permutation]])
* R' U L' U2 R U' x' U L' U2 R U' L
* [R' U R' U'] y [R' F'] [R2 U' R' U] [R' F R F]
</td>

<td valign='top'>
==== Swap UF + DF Corners ====
[[Image:PBL3.gif]]
* R2 U' R2' (U2' + y) R2 U' R2'
* R2' U' R2 U2' F2 U' R2
* R2' U' R2 U2' x' U2 x' U' R2
* R2 U F2 U2 R2 U R2
* y2 R2 U' B2 U2' R2' U' R2
* z' U2 L U2 (L' R') U2 R U2
</td>

</tr>
<tr>

<td valign='top'>
==== Swap U + D Diagonal ====
[[Image:PBL4.gif]]

* R2' F2 R2
* R2 B2 R2'
* (R L) U2 (R' L')
</td>

<td valign='top'>
==== Swap UB Corners + D-Layer Diagonal ====
[[Image:PBL5.gif]]

* [R U' R] F2 [R' U R']
* [R U' L] U2 [R' U R']
* y2 [R' U L'] U2 [R U' L]
* x2 y' R2 U' R2 U R2 U' R2 U R2
* z2 R D' L U2 L' D R'
* x2 R D' L U2 R' F U'
</td>

<td valign='top'>
==== Swap UB + DB Corners ====
[[Image:PBL6.gif]]
* R2 U' B2 U2' R2' U' R2
* R2 U R2 U2 F2 U F2
* R2' U R2 U2 y' R2' U R2
* L2' U F2' U2 R2' U R2'
</td>

</tr>
</table>

The first two algorithms (Y perm and A perm) only affect the top layer, and because of that, they can be used in LBL methods.

Note that D moves are the same as U + y, just a different notation, what you do for real is something in between. The effect of it is that you transform F moves to R or L (D R makes the same turns as U F + y').
== See also ==
* [[Ortega]]
* [[Guimond]]
* [[OLL (2x2x2)]]

== External links ==
* [http://dtwoner.110mb.com/index.php?p=1_40_PBL David Woner's PBL algs]
* [http://www.cubewhiz.com/ortegapbl.php Bob Burton's PBL algs]

[[Category:2x2x2 substeps]]
[[Category:Algorithms]]

[[Category:Acronyms]]
__NOTOC__
__NOEDITSECTION__

Megaminx

2016-03-28T16:58:13Z

EastsheenFan:

[[File:Megaminx.jpg|200px|thumb|right|Megaminx]]
The '''Megaminx''' is a [[puzzle]] in the shape of a dodecahedron that was first produced by [[Uwe Meffert]], who has the rights to some of the patents. Each of the 12 sides consists of one pentagonal fixed center, five triangular edge pieces and five corner pieces. The corner and edge pieces are arranged in a five-pointed star pattern. It has 1.01 x 10^68 positions on the 12 colour version and 6.14x10^63 positions on the 6 colour version. A variant where the cuts are a little deeper, so that each face has a five-pointed star on it, is known as the Hungarian Supernova, but since it is similar these names are often interchanged.

==Colour scheme==
The standard colour scheme for most 12-colour Megaminx puzzles is as follows:
* ''red'' is opposite ''orange'';
* ''green'' is opposite ''lime green'';
* ''yellow'' is opposite ''pale yellow'';
* ''white'' is opposite ''grey'';
* ''purple'' is opposite ''pink'';
* ''blue'' is opposite ''dark blue''.

In addition, the colours of the faces around the white face are, in a clockwise order: red, green, purple, yellow and blue.

Some manufacturers (most notably C4U) sometimes use black stickers instead of white, or brown instead of pale yellow.

==Megaminx methods==
{{Main Article|Article=Megaminx Methods}}
The way the Megaminx functions is very similar to the [[3x3x3]]: it has fixed centers, edges with two orientations, and corners with three orientations, and each turn moves the same number of edges and corners. Because of this it can be (and usually is) solved with a variant on a 3x3x3 method, either by placing edges and then corner/edge pairs (like the [[Fridrich method]]) or simply building a series of [[Block building|block]]s (like the [[Petrus method]]). It is also possible to finish using some [[OLL]] and [[PLL]] algorithms. The biggest difference from the 3x3 is that slice moves are not possible and therefore methods that solves edges preserving corners are having much longer algorithms.

== Brands ==
* [[Meffert's Megaminx]]
* [[QJ Megaminx]]
* [[MF8 Megaminx]]
* [[Chinaminx]]
* [[PVC Megaminx]]
* [[DaYan Megaminx]]

==See also==
* [[Meffert's Megaminx]] (brand)
* [[Megaminx methods]]
* [[Megaminx Notation]]
* [[Gigaminx]]
* [[Teraminx]]
* [[Petaminx]]
* [[Pyraminx]]
* [[Pyraminx Crystal]]

==External links==
* {{WP}}
[[Category:Megaminx]]
[[Category:Meffert's Puzzles]]
[[Category:Twisty puzzles]]
[[Category:Twisty puzzles used in WCA-official events]]

{{Stub}}

Petrus Method

2015-07-23T22:12:52Z

EastsheenFan: I don't know where in the world you live but worldwide, "orientate" is exponentially more common that "orient".

{{Method Infobox
|name=Petrus
|image=Petrus_method.gif
|proposers=[[Lars Petrus]]
|year=1981
|anames
|algs=2 to 493 (for the last layer)
|variants
|steps=7
|moves=45-55
|purpose=<sup></sup>
* [[Fewest Moves]]
* [[Speedsolving]]
}}
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 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.

3. Fix the "bad edges" (in other words, orientate 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. Permutate the last-layer corners (put them in their correct places).

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

7. Permutate 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 orientate and permutate 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.

== Petrus variations ==

There are several other [[substep]]s that can be used [[EJLS]], [[WV]], [[COLL]], and [[ZBLL]], which completes the entire 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]]

PBL

2015-07-22T19:51:20Z

EastsheenFan: Undo revision 26628 by EastsheenFan (talk) Actually, I take that back

'''Permutation of both layers''', abbreviated as '''PBL''', is a [[step]] used in a number of [[2x2x2]] methods (and thus [[corners first]] methods). Specifically, the [[Ortega method]] and the [[Guimond method]], perhaps the two most popular advanced [[2x2x2]] methods, both finish with a PBL step. When solving only corners, PBL has five unsolved cases, which can be recognized by the number of pairs on each side that are correctly permuted (a solved side has 4 pairs, an adjacent swap has 1 pair, and an opposite swap has 0 pairs), so the unsolved cases are 0+0, 1+0, 1+1, 4+0, and 4+1. [[Algorithm]]s for PBL (for 2x2x2 or CF) can be found at the [[Template:CxLLnav|CxLL]] pages (the grey cases in the topmost line).

It is actually possible, in theory, to do PBL in one step for [[3x3x3]] or [[Square-1]] - in this case we would be permuting not only corners but the whole layers. No [[speedcubing]] method actually uses this, though, because there are about 800 cases in total and recognition is very difficult. For the [[Square-1]], many methods do PBL in two steps, by first solving the [[corner]]s of both layers and then doing the [[edges]] of both layers. Even though two layers are being permuted at once, though, solvers conventionally refer to the steps as simply [[CP]] and [[EP]].

== Algorithms ==
<table cellspacing='5' cellpadding='5'><tr>
<td valign='top'>
==== Swap UF Corners ====

[[Image:PBL1.gif]]
* y' x U2 R' U' R U2 L' U R' U' R2
* (R' F R') B2 R F' (R' B2 R2) ([[PLL#A_Permutation_:_a|A Permutation]])
* U' x' R2 U2 R' U' R U2 L' U R'
* y' R2 F2 R' U' R F2 R' U R'
* y' (U') R' U L' U2 R U' R' U2 R L
* y' R U R' U' R' F R2 U' R' U' R U R' F' ([[PLL#T_Permutation_:_t|T Permutation]])
* R U2 R' U' R U2 L' U R' U' L'
* y2 R' U L' U2 R U' R' U2 R2 B' (Ja Permutation)

</td>

<td valign='top'>
==== Swap U-Layer Diagonal ====
[[Image:PBL2.gif]]
* (R U' R' U') F2 (U' R U R') D R2
* (R U' R' U') F2 (U' R U R' U) F2
* L' U L D R2 D R' U' R D' R2
* F R U' R' U' R U R' F' R U R' U' R' F R F' ([[PLL#Y_Permutation|Y Permutation]])
* R' U L' U2 R U' x' U L' U2 R U' L
* [R' U R' U'] y [R' F'] [R2 U' R' U] [R' F R F]
</td>

<td valign='top'>
==== Swap UF + DF Corners ====
[[Image:PBL3.gif]]
* R2 U' R2' (U2' + y) R2 U' R2'
* R2' U' R2 U2' F2 U' R2
* R2' U' R2 U2' x' U2 x' U' R2
* R2 U F2 U2 R2 U R2
* y2 R2 U' B2 U2' R2' U' R2
* z' U2 L U2 (L' R') U2 R U2
</td>

</tr>
<tr>

<td valign='top'>
==== Swap U + D Diagonal ====
[[Image:PBL4.gif]]

* R2' F2 R2
* R2 B2 R2'
* (R L) U2 (R' L')
</td>

<td valign='top'>
==== Swap UB Corners + D-Layer Diagonal ====
[[Image:PBL5.gif]]

* [R U' R] F2 [R' U R']
* [R U' L] U2 [R' U R']
* y2 [R' U L'] U2 [R U' L]
* x2 y' R2 U' R2 U R2 U' R2 U R2
* z2 R D' L U2 L' D R'
* x2 R D' L U2 R' F U'
</td>

<td valign='top'>
==== Swap UB + DB Corners ====
[[Image:PBL6.gif]]
* R2 U' B2 U2' R2' U' R2
* R2 U R2 U2 F2 U F2
* R2' U R2 U2 y' R2' U R2
* L2' U F2' U2 R2' U R2'
</td>

</tr>
</table>

The first two algorithms (Y perm and A perm) only affect the top layer, and because of that, they can be used in LBL methods.

Note that D moves are the same as U + y, just a different notation, what you do for real is something in between. The effect of it is that you transform F moves to R or L (D R makes the same turns as U F + y').
== See also ==
* [[Ortega]]
* [[Guimond]]
* [[OLL (2x2x2)]]

== External links ==
* [http://dtwoner.110mb.com/index.php?p=1_40_PBL David Woner's PBL algs]
* [http://www.cubewhiz.com/ortegapbl.php Bob Burton's PBL algs]

[[Category:2x2x2 substeps]]
[[Category:Algorithms]]

[[Category:Acronyms]]
__NOTOC__
__NOEDITSECTION__

PBL

2015-07-22T19:50:07Z

EastsheenFan:

'''Permutation of both layers''', abbreviated as '''PBL''', is a [[step]] used in a number of [[2x2x2]] methods (and thus [[corners first]] methods). Specifically, the [[Ortega method]] and the [[Guimond method]], perhaps the two most popular advanced [[2x2x2]] methods, both finish with a PBL step. When solving only corners, PBL has five unsolved cases, which can be recognized by the number of pairs on each side that are correctly permuted (a solved side has 4 pairs, an adjacent swap has 1 pair, and an opposite swap has 0 pairs), so the unsolved cases are 0+0, 1+0, 1+1, 4+0, and 4+1. [[Algorithm]]s for PBL (for 2x2x2 or CF) can be found at the [[Template:CxLLnav|CxLL]] pages (the grey cases in the topmost line).

It is actually possible, in theory, to do PBL in one step for [[3x3x3]] or [[Square-1]] - in this case we would be permuting not only corners but the whole layers. No [[speedcubing]] method actually uses this, though, because there are about 800 cases in total and recognition is very difficult. For the [[Square-1]], many methods do PBL in two steps, by first solving the [[corner]]s of both layers and then doing the [[edges]] of both layers. Even though two layers are being permuted at once, though, solvers conventionally refer to the steps as simply [[CP]] and [[EP]].

== Algorithms ==
<table cellspacing='5' cellpadding='5'><tr>
<td valign='top'>
==== Swap UF Corners ====

[[Image:PBL1.gif]]
* y' x U2 R' U' R U2 L' U R' U' R2
* (R' F R') B2 R F' (R' B2 R2) ([[PLL#A_Permutation_:_a|A Permutation]])
* U' x' R2 U2 R' U' R U2 L' U R'
* y R2 F2 R' U' R F2 R' U R'
* y' (U') R' U L' U2 R U' R' U2 R L
* y' R U R' U' R' F R2 U' R' U' R U R' F' ([[PLL#T_Permutation_:_t|T Permutation]])
* R U2 R' U' R U2 L' U R' U' L'
* y2 R' U L' U2 R U' R' U2 R2 B' (Ja Permutation)

</td>

<td valign='top'>
==== Swap U-Layer Diagonal ====
[[Image:PBL2.gif]]
* (R U' R' U') F2 (U' R U R') D R2
* (R U' R' U') F2 (U' R U R' U) F2
* L' U L D R2 D R' U' R D' R2
* F R U' R' U' R U R' F' R U R' U' R' F R F' ([[PLL#Y_Permutation|Y Permutation]])
* R' U L' U2 R U' x' U L' U2 R U' L
* [R' U R' U'] y [R' F'] [R2 U' R' U] [R' F R F]
</td>

<td valign='top'>
==== Swap UF + DF Corners ====
[[Image:PBL3.gif]]
* R2 U' R2' (U2' + y) R2 U' R2'
* R2' U' R2 U2' F2 U' R2
* R2' U' R2 U2' x' U2 x' U' R2
* R2 U F2 U2 R2 U R2
* y2 R2 U' B2 U2' R2' U' R2
* z' U2 L U2 (L' R') U2 R U2
</td>

</tr>
<tr>

<td valign='top'>
==== Swap U + D Diagonal ====
[[Image:PBL4.gif]]

* R2' F2 R2
* R2 B2 R2'
* (R L) U2 (R' L')
</td>

<td valign='top'>
==== Swap UB Corners + D-Layer Diagonal ====
[[Image:PBL5.gif]]

* [R U' R] F2 [R' U R']
* [R U' L] U2 [R' U R']
* y2 [R' U L'] U2 [R U' L]
* x2 y' R2 U' R2 U R2 U' R2 U R2
* z2 R D' L U2 L' D R'
* x2 R D' L U2 R' F U'
</td>

<td valign='top'>
==== Swap UB + DB Corners ====
[[Image:PBL6.gif]]
* R2 U' B2 U2' R2' U' R2
* R2 U R2 U2 F2 U F2
* R2' U R2 U2 y' R2' U R2
* L2' U F2' U2 R2' U R2'
</td>

</tr>
</table>

The first two algorithms (Y perm and A perm) only affect the top layer, and because of that, they can be used in LBL methods.

Note that D moves are the same as U + y, just a different notation, what you do for real is something in between. The effect of it is that you transform F moves to R or L (D R makes the same turns as U F + y').
== See also ==
* [[Ortega]]
* [[Guimond]]
* [[OLL (2x2x2)]]

== External links ==
* [http://dtwoner.110mb.com/index.php?p=1_40_PBL David Woner's PBL algs]
* [http://www.cubewhiz.com/ortegapbl.php Bob Burton's PBL algs]

[[Category:2x2x2 substeps]]
[[Category:Algorithms]]

[[Category:Acronyms]]
__NOTOC__
__NOEDITSECTION__

Petrus Method

2015-07-22T10:23:47Z

EastsheenFan: Undo revision 26626 by Randomno (talk) "orientate" was correct

{{Method Infobox
|name=Petrus
|image=Petrus_method.gif
|proposers=[[Lars Petrus]]
|year=1981
|anames
|algs=2 to 493 (for the last layer)
|variants
|steps=7
|moves=45-55
|purpose=<sup></sup>
* [[Fewest Moves]]
* [[Speedsolving]]
}}
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 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.

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. Permutate the last-layer corners (put them in their correct places).

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

7. Permutate 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 orientate and permutate 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.

== Petrus variations ==

There are several other [[substep]]s that can be used [[EJLS]], [[WV]], [[COLL]], and [[ZBLL]], which completes the entire 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

2015-07-21T09:06:21Z

EastsheenFan:

{{Method Infobox
|name=Petrus
|image=Petrus_method.gif
|proposers=[[Lars Petrus]]
|year=1981
|anames
|algs=2 to 493 (for the last layer)
|variants
|steps=7
|moves=45-55
|purpose=<sup></sup>
* [[Fewest Moves]]
* [[Speedsolving]]
}}
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 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.

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. Permutate the last-layer corners (put them in their correct places).

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

7. Permutate 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 orientate and permutate 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.

== Petrus variations ==

There are several other [[substep]]s that can be used [[EJLS]], [[WV]], [[COLL]], and [[ZBLL]], which completes the entire 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

2015-07-21T09:05:58Z

EastsheenFan:

{{Method Infobox
|name=Petrus
|image=Petrus_method.gif
|proposers=[[Lars Petrus]]
|year=1981
|anames
|algs=2 to 493 (for the last layer)
|variants
|steps=7
|moves=45-55
|purpose=<sup></sup>
* [[Fewest Moves]]
* [[Speedsolving]]
}}
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 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.

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. Permutate the last-layer corners (put them in their correct places).

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

7. Permutate 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 orientate and permutate 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.

== Petrus variations ==

There are several other [[substep]]s that can be used [[EJLS]], [[WV]], [[COLL]], and [[ZBLL]], which completes the entire 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]]

Shengshou

2013-11-30T17:15:46Z

EastsheenFan:

{{Manufacturer
|NAME=ShengShou
|LOGO=SS Logo.jpg
|LOCATION=China
|YEARSACTIVE=?-present
|AREASSERVED=Worldwide
|PRODUCTS=ShengShou 2x2, ShengShou 3x3, ShengShou 4x4, ShengShou 5x5, ShengShou 6x6, ShengShou 7x7, ShengShou 8x8, ShengShou 9x9, ShengShou 10x10, ShengShou Pyraminx, ShengShou Megaminx, ShengShou Mirror Block
}}

ShengShou (traditional/simplified Chinese: 圣手 pinyin: shèngshǒu, pronounced SHENG-shoo) is a Chinese company that first became widely known after the release of the high-quality 4x4 cube. Since then, they have expanded and have many high-quality cubes.

==Products==

===ShengShou 2x2===

The ShengShou 2x2 is almost identical to the [[GhostHand]] 2x2, but they are not produced by the same company.
The mechanism consists of a bandaged 3x3x3, with rounded up edges and the inner and outer corners connected by a lock-up system.

<u>LighTake Product Pages</u>
* [http://lightake.com/detail.do/sku.29016 Assembled Black]
* [http://www.lightake.com/detail.do/sku.29017 Assembled White]

===ShengShou 3x3===

The ShengShou 3x3 has 3 different versions released currently.

<u>Reviews on Speedsolving.com</u>
* [http://www.speedsolving.com/forum/showthread.php?37669 Shengshou 3x3 review/my thoughts]

===ShengShou 4x4===

One of the best 4x4's on the market. There are 4 versions of this cube on sale. Corner cutting is similar to the Maru, cutting over a cubie. Reverse corner cutting is very good for a 4x4, around a 1/4 of a cubie. It has a spring/screw structure like the Maru but doesn't have misalignment problems. Turning has a clicky feel and the performance improves a bit after some breaking in. The corners/edges is rounded like the Haiyan cube making it having a better feel and more control. The size is reasonable (6.25cmx6.25cmx6.26cm), bigger than an Eastsheen and 2cm smaller than the huge Maru 4x4. At a weight of 161.1g, it has a very comfortable weight. Highly recommended cube and very cheap.

The mechanism is similar to a 5x5x5 Shengshou, with some pieces reduced and hidden.

<u>Reviews on Speedsolving.com</u>
* [http://www.speedsolving.com/forum/showthread.php?31448 ShengShou 4x4 Version III Review ---Tall5001---]
* [http://www.speedsolving.com/forum/showthread.php?35037 ShengShou 4x4x4 Version 3 [Review]]
* [http://www.speedsolving.com/forum/showthread.php?31902 Shengshou 4x4 v3 is AMAZING! -- Review]
* [http://www.speedsolving.com/forum/showthread.php?37127 CUBE REVIEW: ShengShou 4x4x4 V3]
* [http://www.speedsolving.com/forum/showthread.php?34630 ShengShou 4x4 v3 review + 40.09 solve]

<u>LighTake Product Pages</u>
* [http://lightake.com/detail.do/sku.45682 Assembled Black]
* [http://lightake.com/detail.do/sku.45683 Assembled White]

===ShengShou 5x5===
Good cube with mostly positive reviews. It's mechanism it's similar to the 4x4x4 Shengshou with all it's pieces visible. It has 98 external pieces and no hidden internal pieces but the core. It also looks like a V Cube 5, with slightly different proportions.

<u>Reviews on Speedsolving.com</u>
* [http://www.speedsolving.com/forum/showthread.php?35129 ShengShou 5x5x5 [Review]]
* [http://www.speedsolving.com/forum/showthread.php?30061 Shengshou 5x5 Review!]
* [http://www.speedsolving.com/forum/showthread.php?32037 ShengShou 5x5x5 Cube Review!]
* [http://www.speedsolving.com/forum/showthread.php?30368-ShengShou ShengShou 5x5 Review (Video)]

===ShengShou 6x6===

<u>Reviews on Speedsolving.com</u>
* [http://www.speedsolving.com/forum/showthread.php?36070 Shengshou 6x6x6 [Review]]
* [http://www.speedsolving.com/forum/showthread.php?36358 Shengshou 6x6 Review -Tall5001]
* [http://www.speedsolving.com/forum/showthread.php?33872 Cube Review: ShengShou 6x6x6 Cube]

===ShengShou 7x7===

<u>Reviews on Speedsolving.com</u>
* [http://www.speedsolving.com/forum/showthread.php?36315 ShengShou 7x7x7 solve + review (by qqwref)]
* [http://www.speedsolving.com/forum/showthread.php?36453 ShengShou 7x7 Unboxing and Review]

<u>LighTake Product Pages</u>
* [http://lightake.com/detail.do/sku.52908 Assembled Black]
* [http://lightake.com/detail.do/sku.52909 Assembled White]

===ShengShou 8x8===

<u>Reviews on Speedsolving.com</u>
* [http://www.speedsolving.com/forum/showthread.php?36608 [video Shengshou 8x8 Review -Tall5001]

===ShengShou 9x9===

===ShengShou 10x10===

===ShengShou Pyraminx===

===ShengShou Megaminx===

===ShengShou Mirror Block===

<u>Reviews on Speedsolving.com</u>
* [http://www.speedsolving.com/forum/showthread.php?38648 Review of the ShengShou Pyraminx]

[[Category:Puzzle Manufacturers]]

PBL

2013-10-29T09:53:43Z

EastsheenFan:

'''Permutation of both layers''', abbreviated as '''PBL''', is a [[step]] used in a number of [[2x2x2]] methods (and thus [[corners first]] methods). Specifically, the [[Ortega method]] and the [[Guimond method]], perhaps the two most popular advanced [[2x2x2]] methods, both finish with a PBL step. When solving only corners, PBL has five unsolved cases, which can be recognized by the number of pairs on each side that are correctly permuted (a solved side has 4 pairs, an adjacent swap has 1 pair, and an opposite swap has 0 pairs), so the unsolved cases are 0+0, 1+0, 1+1, 4+0, and 4+1. [[Algorithm]]s for PBL (for 2x2x2 or CF) can be found at the [[Template:CxLLnav|CxLL]] pages (the grey cases in the topmost line).

It is actually possible, in theory, to do PBL in one step for [[3x3x3]] or [[Square-1]] - in this case we would be permuting not only corners but the whole layers. No [[speedcubing]] method actually uses this, though, because there are about 800 cases in total and recognition is very difficult. For the [[Square-1]], many methods do PBL in two steps, by first solving the [[corner]]s of both layers and then doing the [[edges]] of both layers. Even though two layers are being permuted at once, though, solvers conventionally refer to the steps as simply [[CP]] and [[EP]].

== Algorithms ==
<table cellspacing='5' cellpadding='5'><tr>
<td valign='top'>
==== Swap UF Corners ====

[[Image:PBL1.gif]]
* y' x U2 R' U' R U2 L' U R' U' R2
* R' F R' B2 R F' R' B2 R2 ([[PLL#A_Permutation_:_a|A Permutation]])
* U' x' R2 U2 R' U' R U2 L' U R'
* y' R2 F2 R' U' R F2 R' U R'
* y' (U') R' U L' U2 R U' R' U2 R L
* y' R U R' U' R' F R2 U' R' U' R U R' F' ([[PLL#T_Permutation_:_t|T Permutation]])
* R U2 R' U' R U2 L' U R' U' L'
</td>

<td valign='top'>
==== Swap U-Layer Diagonal ====
[[Image:PBL2.gif]]
* R U' R' U' F2 U' R U R' D R2
* R U' R' U' F2 U' R U R' U F2
* L' U L D R2 D R' U' R D' R2
* F R U' R' U' R U R' F' R U R' U' R' F R F' ([[PLL#Y_Permutation|Y Permutation]])
* R' U L' U2 R U' x' U L' U2 R U' L
</td>

<td valign='top'>
==== Swap UF + DF Corners ====
[[Image:PBL3.gif]]
* R2 U' R2' (U2' + y) R2 U' R2'
* R2' U' R2 U2' F2 U' R2
* R2' U' R2 U2' x' U2 x' U' R2
* R2 U F2 U2 R2 U R2
* y2 R2 U' B2 U2' R2' U' R2
* z' U2 L U2 (L' R') U2 R U2
</td>

</tr>
<tr>

<td valign='top'>
==== Swap U + D Diagonal ====
[[Image:PBL4.gif]]

* R2' F2 R2
* (R L) U2 (R' L')
</td>

<td valign='top'>
==== Swap UB Corners + D-Layer Diagonal ====
[[Image:PBL5.gif]]

* R U' R F2 R' U R'
* R U' L U2 R' U R'
* y2 R' U L' U2 R U' L
* x2 y' R2 U' R2 U R2 U' R2 U R2
* z2 R D' L U2 L' D R'
* x2 R D' L U2 R' F U'
</td>

<td valign='top'>
==== Swap UB + DB Corners ====
[[Image:PBL6.gif]]
* R2 U' B2 U2' R2' U' R2
* R2 U R2 U2 F2 U F2
* R2' U R2 U2 y' R2' U R2
* L2' U F2' U2 R2' U R2'
</td>

</tr>
</table>

The first two algorithms (Y perm and A perm) only affect the top layer, and because of that, they can be used in LBL methods.

Note that D moves are the same as U + y, just a different notation, what you do for real is something in between. The effect of it is that you transform F moves to R or L (D R makes the same turns as U F + y').
== See also ==
* [[Ortega]]
* [[Guimond]]
* [[OLL (2x2x2)]]

== External links ==
* [http://dtwoner.110mb.com/index.php?p=1_40_PBL David Woner's PBL algs]
* [http://www.cubewhiz.com/ortegapbl.php Bob Burton's PBL algs]

[[Category:2x2x2 substeps]]
[[Category:Algorithms]]

[[Category:Acronyms]]
__NOTOC__
__NOEDITSECTION__

PBL

2013-10-29T09:52:17Z

EastsheenFan:

'''Permutation of both layers''', abbreviated as '''PBL''', is a [[step]] used in a number of [[2x2x2]] methods (and thus [[corners first]] methods). Specifically, the [[Ortega method]] and the [[Guimond method]], perhaps the two most popular advanced [[2x2x2]] methods, both finish with a PBL step. When solving only corners, PBL has five unsolved cases, which can be recognized by the number of pairs on each side that are correctly permuted (a solved side has 4 pairs, an adjacent swap has 1 pair, and an opposite swap has 0 pairs), so the unsolved cases are 0+0, 1+0, 1+1, 4+0, and 4+1. [[Algorithm]]s for PBL (for 2x2x2 or CF) can be found at the [[Template:CxLLnav|CxLL]] pages (the grey cases in the topmost line).

It is actually possible, in theory, to do PBL in one step for [[3x3x3]] or [[Square-1]] - in this case we would be permuting not only corners but the whole layers. No [[speedcubing]] method actually uses this, though, because there are about 800 cases in total and recognition is very difficult. For the [[Square-1]], many methods do PBL in two steps, by first solving the [[corner]]s of both layers and then doing the [[edges]] of both layers. Even though two layers are being permuted at once, though, solvers conventionally refer to the steps as simply [[CP]] and [[EP]].

== Algorithms ==
<table cellspacing='5' cellpadding='5'><tr>
<td valign='top'>
==== Swap UF Corners ====

[[Image:PBL1.gif]]
* y' x U2 R' U' R U2 L' U R' U' R2
* R' F R' B2 R F' R' B2 R2 ([[PLL#A_Permutation_:_a|A Permutation]])
* U' x' R2 U2 R' U' R U2 L' U R'
* y' R2 F2 R' U' R F2 R' U R'
* y' (U') R' U L' U2 R U' R' U2 R L
* y' R U R' U' R' F R2 U' R' U' R U R' F' ([[PLL#T_Permutation_:_t|T Permutation]])
* R U2 R' U' R U2 L' U R' U' L'
</td>

<td valign='top'>
==== Swap U-Layer Diagonal ====
[[Image:PBL2.gif]]
* R U' R' U' F2 U' R U R' D R2
* R U' R' U' F2 U' R U R' U F2
* L' U L D R2 D R' U' R D' R2
* F R U' R' U' R U R' F' R U R' U' R' F R F' ([[PLL#Y_Permutation|Y Permutation]])
* R' U L' U2 R U' x' U L' U2 R U' L
</td>

<td valign='top'>
==== Swap UF + DF Corners ====
[[Image:PBL3.gif]]
* R2 U' R2' (U2' + y) R2 U' R2'
* R2' U' R2 U2' F2 U' R2
* R2' U' R2 U2' x' U2 x' U' R2
* R2 U R2 U2 F2 U F2
* R2 U F2 U2 R2 U R2
* y2 R2 U' B2 U2' R2' U' R2
* z' U2 L U2 (L' R') U2 R U2
</td>

</tr>
<tr>

<td valign='top'>
==== Swap U + D Diagonal ====
[[Image:PBL4.gif]]

* R2' F2 R2
* (R L) U2 (R' L')
</td>

<td valign='top'>
==== Swap UB Corners + D-Layer Diagonal ====
[[Image:PBL5.gif]]

* R U' R F2 R' U R'
* R U' L U2 R' U R'
* y2 R' U L' U2 R U' L
* x2 y' R2 U' R2 U R2 U' R2 U R2
* z2 R D' L U2 L' D R'
* x2 R D' L U2 R' F U'
</td>

<td valign='top'>
==== Swap UB + DB Corners ====
[[Image:PBL6.gif]]
* R2 U' B2 U2' R2' U' R2
* R2' U R2 U2 y' R2' U R2
* L2' U F2' U2 R2' U R2'
</td>

</tr>
</table>

The first two algorithms (Y perm and A perm) only affect the top layer, and because of that, they can be used in LBL methods.

Note that D moves are the same as U + y, just a different notation, what you do for real is something in between. The effect of it is that you transform F moves to R or L (D R makes the same turns as U F + y').
== See also ==
* [[Ortega]]
* [[Guimond]]
* [[OLL (2x2x2)]]

== External links ==
* [http://dtwoner.110mb.com/index.php?p=1_40_PBL David Woner's PBL algs]
* [http://www.cubewhiz.com/ortegapbl.php Bob Burton's PBL algs]

[[Category:2x2x2 substeps]]
[[Category:Algorithms]]

[[Category:Acronyms]]
__NOTOC__
__NOEDITSECTION__