Speedsolving.com Wiki - User contributions [en]

SS Method

2011-05-28T16:07:57Z

Kevin:

{{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, 3/4 of a face is solved. In the second step, the face is finished while simultaneously orienting the opposite face. Finally, both layers are permuted 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:Methods]]
[[Category:2x2x2 Methods]]
[[Category:2x2x2 Speedsolving Methods]]

EG Method

2011-05-28T11:19:43Z

Kevin:

{{Method Infobox
|name=EG
|image=Eg_method.gif
|proposers=[[Erik Akkersdijk]] [[Gunnar Krig]]
|year=2006
|anames
|variants=[[CLL]]
|steps=2
|algs=128 (including PBL)
|moves=12.35
|purpose=
* [[Speedsolving]]
}}
The '''EG method''' (Erik-Gunnar), so far only used for the [[2x2x2 cube]], only has two [[step]]s: solve one [[face]], and then finish the entire cube in one algorithm. Without reflections, it requires 128 algorithms. There are 3 bottom layer cases that each require the same amount of algorithms as [[CLL]]. Those that know CLL already know 1/3rd of EG. The other two groups of cases have a T permutation on bottom (EG 1), and a Y permutation on bottom (EG 2).

{| border="0"
| valign="top"|[[Image:2x2 EG 2.jpg|160px|thumb|CLL first layer]]
| valign="top"|[[Image:2x2 EG 1.jpg|160px|thumb|EG 1 first layer]]
| valign="top"|[[Image:2x2 EG 0.jpg|160px|thumb|EG 2 first layer]]
|}
'''EG''' is by far the best method for solving the cube in one look, many scrambles have an easy first layer so it is often easy to see the whole solve in the inspection, this is the strongest reason for learning EG, most other times you are better off using [[CLL]]. This because of the many cases, it takes a great lot of practice to learn to do all fast (in EG 1 it is not only the case and alg, you also have to remember on which side you need to put the FL pair before the alg) but the worst problem with EG is the AUF's you get in EG 1 (that occures 4:6 times). You need to AUF first before and then after the alg and it is not possible to pre AUF like it is in CLL because of the need of the first AUF (you got to have LL aligned propely to the pair in the first layer to swap the correct FL pieces). CLL has got a more complicated first layer on average but you regain it in the end.

The best is probably to learn EG but use CLL for all cases where you cannot see the whole solve in the inspection.

==EG 2 or not?==
Some cubers have only learnt CLL and EG1 because you can cancel the last moves of making a face with 'R2 F2 R2' (0+0 PBL) if you see that you will have a EG 2 case, giving you a CLL case.

Another method that has been used for EG 2 is to inverse solve LL using normal CLL, say you have EG 0 and [[CxLL H D]], then you can use the CLL for [[CxLL H U]] that will "solve" LL to diagonal permut and then add the permutation for [[PBL]] 0+0 in the end. In some cases, like this, the alg ends in R2 so the only extra turn you need to add is the F2, like this; orginal CLL ''R2 U2 R U2 R2'' makes ''R2 U2 R U2 '''F2''' R2'' to solve the inverse CLL and 0+0 PBL. All CLL's have an inverse CLL, to look at the pairs just set up one case and do the 0+0 PBL (R2 F2 R2) and you will have the inverse instead. It is also possible to insert a single F2 PBL in the middle of a CLL alg if pieces are in correct position but this will not always solve the inverse case but some diffrent one, this shows that; null alg R U2 R - R' U2 R', with insert R U2 R '''F2''' R' U2 R' (you have to test it on a cube to see the effect of the insert).

Those who learn EG and chooses to 'cheat' in the EG 2 part should be aware of the fact that the EG 2 cases are often easy to solve, if you add the permutation in the last part of the first layer you also add turns, naturally, but you may also get a longer alg for the CLL than you would have gotten for the EG 2 case, you will loose double those times. On average you can improve a good bit by learning also the last part of the method.

==EG for 3x3?==
It is possible to use EG for the [[3x3x3 cube]] as a [[columns first]] method but with a diffrent set of algorithms. The idea is to orient four pairs without minding relative order and then sort the pairs and solve CLL using a EG algorithm, one that preserves the pairs, "Pairs EG" or [[PEG]]. But this has only been tested as a experimental method so far.

=== See also ===
* [[CLL]]
* [[2x2x2 Methods]]

== External Links ==
* [http://erikku.er.funpic.org/rubik/EGIndex.html Erik Akkersdijk's Tutorial]
* [http://dtwoner.110mb.com/index.php?p=1_42_EG1 Algs for the EG1 set] (by David Woner)
* [http://www.speedcubing101.com/eg-1.html More algs for EG1] (by Anthony Brooks)
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=5184 EG(D?) 2x2 method- 12.35 move avg.]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=18486 Good EG + CLL Algorithms]
* [https://docs.google.com/leaf?id=0B1HP6i5J4mf9ZTY3NTY5OTQtMzdkNC00OTBjLTgyOTgtZGZmYjgzNDgzNDY1&hl=en_US EG2 Algorithms Word Doc]

[[Category:Methods]]
[[Category:2x2x2 Methods]]
[[Category:2x2x2 Speedsolving Methods]]

EG Method

2011-05-28T11:08:02Z

Kevin:

{{Method Infobox
|name=EG
|image=Eg_method.gif
|proposers=[[Erik Akkersdijk]] [[Gunnar Krig]]
|year=2006
|anames
|variants=[[CLL]]
|steps=2
|algs=128 (including PBL)
|moves=12.35
|purpose=
* [[Speedsolving]]
}}
The '''EG method''' (Erik-Gunnar), so far only used for the [[2x2x2 cube]], only has two [[step]]s: solve one [[face]], and then finish the entire cube in one algorithm. Without reflections, it requires 128 algorithms. There are 3 bottom layer cases that each require the same amount of algorithms as [[CLL]]. Those that know CLL already know 1/3rd of EG. The other two groups of cases have a T permutation on bottom (EG 1), and a Y permutation on bottom (EG 2).

{| border="0"
| valign="top"|[[Image:2x2 EG 2.jpg|160px|thumb|CLL first layer]]
| valign="top"|[[Image:2x2 EG 1.jpg|160px|thumb|EG 1 first layer]]
| valign="top"|[[Image:2x2 EG 0.jpg|160px|thumb|EG 2 first layer]]
|}
'''EG''' is by far the best method for solving the cube in one look, many scrambles have an easy first layer so it is often easy to see the whole solve in the inspection, this is the strongest reason for learning EG, most other times you are better off using [[CLL]]. This because of the many cases, it takes a great lot of practice to learn to do all fast (in EG 1 it is not only the case and alg, you also have to remember on which side you need to put the FL pair before the alg) but the worst problem with EG is the AUF's you get in EG 1 (that occures 4:6 times). You need to AUF first before and then after the alg and it is not possible to pre AUF like it is in CLL because of the need of the first AUF (you got to have LL aligned propely to the pair in the first layer to swap the correct FL pieces). CLL has got a more complicated first layer on average but you regain it in the end.

The best is probably to learn EG but use CLL for all cases where you cannot see the whole solve in the inspection.

==EG 2 or not?==
Some cubers have only learnt CLL and EG1 because you can cancel the last moves of making a face with 'R2 F2 R2' (0+0 PBL) if you see that you will have a EG 2 case, giving you a CLL case.

Another method that has been used for EG 2 is to inverse solve LL using normal CLL, say you have EG 0 and [[CxLL H D]], then you can use the CLL for [[CxLL H U]] that will "solve" LL to diagonal permut and then add the permutation for [[PBL]] 0+0 in the end. In some cases, like this, the alg ends in R2 so the only extra turn you need to add is the F2, like this; orginal CLL ''R2 U2 R U2 R2'' makes ''R2 U2 R U2 '''F2''' R2'' to solve the inverse CLL and 0+0 PBL. All CLL's have an inverse CLL, to look at the pairs just set up one case and do the 0+0 PBL (R2 F2 R2) and you will have the inverse instead. It is also possible to insert a single F2 PBL in the middle of a CLL alg if pieces are in correct position but this will not always solve the inverse case but some diffrent one, this shows that; null alg R U2 R - R' U2 R', with insert R U2 R '''F2''' R' U2 R' (you have to test it on a cube to see the effect of the insert).

Those who learn EG and chooses to 'cheat' in the EG 2 part should be aware of the fact that the EG 2 cases are often easy to solve, if you add the permutation in the last part of the first layer you also add turns, naturally, but you may also get a longer alg for the CLL than you would have gotten for the EG 2 case, you will loose double those times. On average you can improve a good bit by learning also the last part of the method.

==EG for 3x3?==
It is possible to use EG for the [[3x3x3 cube]] as a [[columns first]] method but with a diffrent set of algorithms. The idea is to orient four pairs without minding relative order and then sort the pairs and solve CLL using a EG algorithm, one that preserves the pairs, "Pairs EG" or [[PEG]]. But this has only been tested as a experimental method so far.

=== See also ===
* [[CLL]]
* [[2x2x2 Methods]]

== External Links ==
* [http://erikku.er.funpic.org/rubik/EGIndex.html Erik Akkersdijk's Tutorial]
* [http://dtwoner.110mb.com/index.php?p=1_42_EG1 Algs for the EG1 set] (by David Woner)
* [http://www.speedcubing101.com/eg-1.html More algs for EG1] (by Anthony Brooks)
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=5184 EG(D?) 2x2 method- 12.35 move avg.]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=18486 Good EG + CLL Algorithms]
* [https://docs.google.com/leaf?id=0B1HP6i5J4mf9ZTY3NTY5OTQtMzdkNC00OTBjLTgyOTgtZGZmYjgzNDgzNDY1&hl=en_US EG2 Algorithms Doc]

[[Category:Methods]]
[[Category:2x2x2 Methods]]
[[Category:2x2x2 Speedsolving Methods]]

SOAP Method

2011-05-28T08:20:11Z

Kevin:

{{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, two opposite colours are separated into opposite layers, and half a face is built on the bottom. Next all pieces are oriented using one of 53 algorithms, and finally both layers are permuted ([[PBL]]).

It is possible for all of the orientation algs to be 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 the cube can often be solved 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]
* [https://docs.google.com/leaf?id=0B1HP6i5J4mf9NjgwODRkZjAtNzMwNC00YmY4LWE3YjYtN2I2M2U2M2Q3ZjE0&hl=en_US SOAP Method Algorithms Word Doc]

[[Category:Methods]]
[[Category:2x2x2 Methods]]
[[Category:2x2x2 Speedsolving Methods]]

{{Stub}}