https://www.speedsolving.com/wiki/api.php?action=feedcontributions&feedformat=atom&user=Cubeboy9235Speedsolving.com Wiki - User contributions [en]2026-10-21T16:01:45ZUser contributionsMediaWiki 1.43.8https://www.speedsolving.com/wiki/index.php?title=Petrus_Method&diff=24853Petrus Method2014-10-15T06:18:57Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Petrus<br />
|image=Petrus_method.gif<br />
|proposers=[[Lars Petrus]]<br />
|year=1981<br />
|anames<br />
|algs=2 to 493 (for the last layer)<br />
|variants<br />
|steps=7<br />
|moves=45-55<br />
|purpose=<sup></sup><br />
* [[Fewest Moves]]<br />
* [[Speedsolving]]<br />
}}<br />
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.<br />
<br />
== The Steps ==<br />
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.<br />
<br />
<br />
1. Build a [[2x2x2 block]] anywhere on the cube.<br />
<br />
2. Expand the [[2x2x2 block]] to a [[2x2x3 block]], three ways are possible.<br />
<br />
3. Fix the "bad edges" or orient the remaining seven edges on the cube that have not been solved.<br />
<br />
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.<br />
<br />
5. Permute the last layer corners, or put them in their proper places (they do not have to be oriented.)<br />
<br />
6. Orient the last layer corners, making the whole last layer a solid color.<br />
<br />
7. Permute the last layer edges, without disturbing the other pieces, to solve the cube.<br />
<br />
== Pros ==<br />
<br />
The Petrus Method uses fewer moves than the [[Fridrich]] method and most other non-block-building methods. It is more intuitive than the Fridrich method, and it requires far less algorithms. If [[COLL]] is used as well, you 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.<br />
<br />
== Cons ==<br />
<br />
It can be sometimes hard (especially for a beginner) to optimize block building, and it's difficult to keep consistently turning throughout the solve.<br />
<br />
== Petrus variations ==<br />
<br />
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.<br />
<br />
== Petrus as a Beginner Method ==<br />
Used as a beginner method, Petrus requires much more intuition, but also involves learning fewer algorithms. For a tutorial, see the external links below.<br />
<br />
== External links ==<br />
<br />
* [http://lar5.com/cube/ Lars Petrus's tutorial]<br />
* [http://petrus-speed.netne.net/ Petrus Speed Website]<br />
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?t=14014 YouTube Beginner Petrus Tutorial]<br />
* YouTube: [http://www.youtube.com/watch?v=EQ9OrFVQw0o Petrus Tutorial] by fallofshadows<br />
* YouTube: [http://www.youtube.com/watch?v=WqXdO2H2FTs Petrus Tutorial] by CuberChris<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 beginner methods]]<br />
[[Category:3x3x3 Speedsolving Methods]]<br />
[[Category:Fewest Moves Methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Tripod_Method&diff=24776Tripod Method2014-09-30T17:13:39Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Tripod<br />
|image=Tripod_method.gif<br />
|proposers=[[Ryan Heise]],[[Michael Gottlieb]] <br />
|year=2002<br />
|anames<br />
|variants= [[Petrus]]<br />
|steps=4<br />
|moves= approx. 50<br />
|purpose= [[Speedsolving]]<br />
}}<br />
<br />
A blockbuilding approach to solving the 3x3x3, first proposed by Ryan Heise and developed by Michael Gottlieb and Mirek Goljan. The final step involves solving a 'tripod' composed of the three 1x1x2 columns connected to the URF corner piece.The steps are as follows-<br />
<br />
1. Build a 2x2x2 block. This is an intuitive step.<br />
<br />
2.Build 3 1x2x2 block side by side the 2x2x2 block. This is also an intuitive step.<br />
<br />
3. Insert the last F2L slot.<br />
<br />
4. Finish the last layer using one of 58 algorithms.<br />
<br />
<br />
<br />
== External links ==<br />
* [http://web.mac.com/teisenmann/Tripod/main.html Web-based tutorial]<br />
* [http://www.ws.binghamton.edu/fridrich/L1/ece.htm Mirek Goljan's tripod algorithms]<br />
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/2234 Ryan Heise's Post]<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 Speedsolving Methods]]<br />
<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Tripod_Method&diff=24775Tripod Method2014-09-30T17:12:32Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Tripod<br />
|image=Tripod_method.gif<br />
|proposers=[[Ryan Heise]],[[Michael Gottlieb]] <br />
|year=2002<br />
|anames<br />
|variants= [[Petrus]]<br />
|steps=4<br />
|moves= approx. 55<br />
|purpose= [[Speedsolving]]<br />
}}<br />
<br />
A blockbuilding approach to solving the 3x3x3, first proposed by Ryan Heise and developed by Michael Gottlieb and Mirek Goljan. The final step involves solving a 'tripod' composed of the three 1x1x2 columns connected to the URF corner piece.The steps are as follows-<br />
<br />
1. Build a 2x2x2 block. This is an intuitive step.<br />
<br />
2.Build 3 1x2x2 block side by side the 2x2x2 block. This is also an intuitive step.<br />
<br />
3. Insert the last F2L slot.<br />
<br />
4. Finish the last layer using one of 58 algorithms.<br />
<br />
<br />
<br />
== External links ==<br />
* [http://web.mac.com/teisenmann/Tripod/main.html Web-based tutorial]<br />
* [http://www.ws.binghamton.edu/fridrich/L1/ece.htm Mirek Goljan's tripod algorithms]<br />
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/2234 Ryan Heise's Post]<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 Speedsolving Methods]]<br />
<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Tripod_Method&diff=24774Tripod Method2014-09-30T17:10:07Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Tripod<br />
|image=Tripod_method.gif<br />
|proposers=[[Ryan Heise]],[[Michael Gottlieb]] <br />
|year=2002<br />
|anames<br />
|variants= [[Petrus]]<br />
|steps=4<br />
|moves= approx. 55<br />
|purpose= [[Speedsolving]]<br />
}}<br />
<br />
A blockbuilding approach to solving the 3x3x3, first proposed by Ryan Heise and developed by Michael Gottlieb and Mirek Goljan. The final step involves solving a 'tripod' composed of the three 1x1x2 columns connected to the URF corner piece.The steps are as follows-<br />
<br />
1. Build a 2x2x2 block. This is an intuitive step.<br />
<br />
2.Build 3 1x2x2 block side by side the 2x2x2 block. This is also an intuitive step.<br />
<br />
3. Insert the last F2L slot.<br />
<br />
4. Finish the last layer.<br />
<br />
<br />
<br />
== External links ==<br />
* [http://web.mac.com/teisenmann/Tripod/main.html Web-based tutorial]<br />
* [http://www.ws.binghamton.edu/fridrich/L1/ece.htm Mirek Goljan's tripod algorithms]<br />
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/2234 Ryan Heise's Post]<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 Speedsolving Methods]]<br />
<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Tripod_Method&diff=24773Tripod Method2014-09-30T17:09:04Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Tripod<br />
|image=Tripod_method.gif<br />
|proposers=[[Ryan Heise]],[[Michael Gottlieb]] <br />
|year=2002<br />
|anames<br />
|variants= [[Petrus]]<br />
|steps=6<br />
|moves= approx. 55<br />
|purpose= [[Speedsolving]]<br />
}}<br />
<br />
A blockbuilding approach to solving the 3x3x3, first proposed by Ryan Heise and developed by Michael Gottlieb and Mirek Goljan. The final step involves solving a 'tripod' composed of the three 1x1x2 columns connected to the URF corner piece.The steps are as follows-<br />
<br />
1. Build a 2x2x2 block. This is an intuitive step.<br />
<br />
2.Build 3 1x2x2 block side by side the 2x2x2 block. This is also an intuitive step.<br />
<br />
3. Insert the last F2L slot.<br />
<br />
4. Finish the last layer.<br />
<br />
<br />
<br />
== External links ==<br />
* [http://web.mac.com/teisenmann/Tripod/main.html Web-based tutorial]<br />
* [http://www.ws.binghamton.edu/fridrich/L1/ece.htm Mirek Goljan's tripod algorithms]<br />
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/2234 Ryan Heise's Post]<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 Speedsolving Methods]]<br />
<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Layer_by_layer&diff=24772Layer by layer2014-09-30T17:01:21Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=LBL (3x3x3)<br />
|image=Layer_by_layer.gif<br />
|proposers=none<br />
|year=1980s<br />
|anames<br />
|variants=[[CFOP]], [[8355]]<br />
|steps=5+<br />
|algs=20<br />
|moves=100+<br />
|purpose=<sup></sup><br />
* [[Beginner method]]<br />
* [[Speedsolving]]<br />
}}<br />
'''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.<br />
<br />
__NOTOC__<br />
<br clear="right"><br />
== 3x3x3 LBL Method ==<br />
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.<br />
<br />
== 2x2x2 LBL Method ==<br />
{{Method Infobox<br />
|name=LBL (2x2x2)<br />
|image=Lbl.gif<br />
|proposers=none<br />
|year=1980s<br />
|anames<br />
|variants=[[CLL]]<br />
|steps=3<br />
|algs=9<br />
|moves<br />
|purpose=<sup></sup><br />
* [[Beginner Method]]<br />
* [[Speedsolving]]<br />
}}<br />
<br />
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:<br />
<br />
* Orientation followed by Permutation<br />
* Permutation followed by Orientation<br />
<br />
==See also==<br />
* [[LOL]]<br />
* [[OLL]]<br />
* [[PLL]]<br />
* [[OLL (2x2x2)]]<br />
* [[Layer]]<br />
* [[First Layer]]<br />
* [[Last Layer]]<br />
* [[4-Look Last Layer]]<br />
<br />
== External links ==<br />
* YouTube: [http://www.youtube.com/user/CubeRight#p/u/8/VVrOmmKnVjo CubeRight's] excellent (HD) beginner tutorial. Easy transition to Fridrich method.<br />
* YouTube: [http://www.youtube.com/watch?v=609nhVzg-5Q Badmephiosto's Beginners Tutorial] excellent quality tutorial. Method designed for easy transition to Fridrich<br />
* YouTube: [http://ca.youtube.com/watch?v=ofZFUgaxlTQ Badmephisto's OLD Beginners Tutorial] .. the outdated version.<br />
* 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<br />
* [http://www.rubiksplace.com Beginners solution with animations] Excellent tutorial at www.rubiksplace.com<br />
* [http://www.monkeysee.com/play/1113-solve-rubik-s-cube Bob Burton's Tutorial] (video)<br />
* [http://www.rubiks.com/Academy/Tyson%20Video.aspx Tyson Mao's video tutorial on rubiks.com] (video)<br />
* [http://www.stanford.edu/~leyanlo/cube_solution.pdf Leyan's guide for beginners] '''(PDF)'''<br />
* [http://peter.stillhq.com/jasmine/rubikscubesolution.html Jasmine Lee's Beginner Solution]<br />
* [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)<br />
* [http://erikku.110mb.com/beginner.html Arnaud van Galen's beginners method explained by Erik Akkersdijk]<br />
* [http://rubikscube.info/beginner.php rubikscube.info Beginner LBL for the 2x2x2]<br />
* [http://joshtime.com/cubing/beginners-method/ JoshTime's Multiple Page LBL Beginner's Method Explanation]<br />
<br />
<br />
[[Category:2x2x2 beginner methods]]<br />
[[Category:3x3x3 beginner methods]]<br />
[[Category:2x2x2 speedsolving methods]]<br />
[[Category:3x3x3 speedsolving methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Layer_by_layer&diff=24771Layer by layer2014-09-30T17:00:29Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=LBL (3x3x3)<br />
|image=Layer_by_layer.gif<br />
|proposers=none<br />
|year=1980s<br />
|anames<br />
|variants=[[CFOP]], [[8355]]<br />
|steps=5+<br />
|algs=20<br />
|moves=100+<br />
|purpose=<sup></sup><br />
* [[Beginner method]]<br />
* [[Speedsolving]]<br />
}}<br />
'''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.<br />
<br />
__NOTOC__<br />
<br clear="right"><br />
== 3x3x3 LBL Method ==<br />
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.<br />
<br />
== 2x2x2 LBL Method ==<br />
{{Method Infobox<br />
|name=LBL (2x2x2)<br />
|image=Lbl.gif<br />
|proposers=none<br />
|year=1980s<br />
|anames<br />
|variants=[[CLL]]<br />
|steps=3<br />
|algs=2 to 9 (depending on [[LL]])<br />
|moves<br />
|purpose=<sup></sup><br />
* [[Beginner Method]]<br />
* [[Speedsolving]]<br />
}}<br />
<br />
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:<br />
<br />
* Orientation followed by Permutation<br />
* Permutation followed by Orientation<br />
<br />
==See also==<br />
* [[LOL]]<br />
* [[OLL]]<br />
* [[PLL]]<br />
* [[OLL (2x2x2)]]<br />
* [[Layer]]<br />
* [[First Layer]]<br />
* [[Last Layer]]<br />
* [[4-Look Last Layer]]<br />
<br />
== External links ==<br />
* YouTube: [http://www.youtube.com/user/CubeRight#p/u/8/VVrOmmKnVjo CubeRight's] excellent (HD) beginner tutorial. Easy transition to Fridrich method.<br />
* YouTube: [http://www.youtube.com/watch?v=609nhVzg-5Q Badmephiosto's Beginners Tutorial] excellent quality tutorial. Method designed for easy transition to Fridrich<br />
* YouTube: [http://ca.youtube.com/watch?v=ofZFUgaxlTQ Badmephisto's OLD Beginners Tutorial] .. the outdated version.<br />
* 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<br />
* [http://www.rubiksplace.com Beginners solution with animations] Excellent tutorial at www.rubiksplace.com<br />
* [http://www.monkeysee.com/play/1113-solve-rubik-s-cube Bob Burton's Tutorial] (video)<br />
* [http://www.rubiks.com/Academy/Tyson%20Video.aspx Tyson Mao's video tutorial on rubiks.com] (video)<br />
* [http://www.stanford.edu/~leyanlo/cube_solution.pdf Leyan's guide for beginners] '''(PDF)'''<br />
* [http://peter.stillhq.com/jasmine/rubikscubesolution.html Jasmine Lee's Beginner Solution]<br />
* [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)<br />
* [http://erikku.110mb.com/beginner.html Arnaud van Galen's beginners method explained by Erik Akkersdijk]<br />
* [http://rubikscube.info/beginner.php rubikscube.info Beginner LBL for the 2x2x2]<br />
* [http://joshtime.com/cubing/beginners-method/ JoshTime's Multiple Page LBL Beginner's Method Explanation]<br />
<br />
<br />
[[Category:2x2x2 beginner methods]]<br />
[[Category:3x3x3 beginner methods]]<br />
[[Category:2x2x2 speedsolving methods]]<br />
[[Category:3x3x3 speedsolving methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Pikas**t&diff=24769Pikas**t2014-09-30T16:23:45Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Pikas**t<br />
|image=pikas--t.gif<br />
|proposers=[[Justin Harder]]<br />
|year=2013<br />
|variants=[[L5E]], [[ELL]]<br />
|steps=4<br />
|algs=9-42<br />
|moves=Est. 50<br />
|purpose=<sup></sup><br />
* [[Speedsolving]]<br />
}}<br />
<br />
'''Pikas**t''' (alternatively spelled sans asterisks) is a 3x3 speedsolving method proposed by Justin Harder on 24 June 2013 as a variant of the [[Petrus Method]]. Drawing influence from the [[Petrus]] and [[Roux]] methods, this method relies heavily on [[blockbuilding]] at the beginning of the solve and [[EO]] recognition at the end.<br />
<br />
<br />
<br />
== The Steps ==<br />
<br />
'''1. <span style="color:red">Build a 2x2x3 block'''</span> anywhere on the cube. It is advised to consult the [[Petrus]] method for assistance. This step is intuitive and requires no algorithms. After formation, this block is traditionally positioned on the lower left side of the cube with respect to the F face, but can be placed where convenient for the next step.<br />
<br />
[[File:Pikas--t.gif|thumb|upright|An example of pieces that can be solved in the C+OP step]]<br />
<br />
'''2.''' Solve <span style="color:orange">'''C+OP'''</span> (Corner Plus One Pair) to complete one full layer of corners with one non-LL edge solved as well. The two corners should be solved adjacent to the block to complete one layer of corners. The solved edge can be anywhere as long as it is attached to one of the aforementioned corners. Because of the "missing [[cross]] piece", other pair insertion techniques are applicable. <br />
<br />
'''3.''' <span style="color:yellow">'''Corners of the Last Layer (CLL)'''</span>. Originally referred to as '''"Solve Remaining Corner"''', This step can be solved using [[CLL algorithms (3x3x3)|3x3 CLL]], [[CMLL]], [[COLL]], and [[OLLCP]]. <br />
<br />
'''4.''' <span style="color:blue">'''Last Six Edges (LSE)'''</span>. Though originally called '''"Solve the Remaining 6 edge"''' as to differentiate it from [[Roux]] [[LSE]], this step is traditionally solved as a pseudo-Roux-LSE as follows:<br />
* <span style="color:green">'''4a.''' Perform set-up moves to position the edges in a traditional LSE configuration</span><br />
* <span style="color:blue">'''4b.''' Roux-style LSE</span><br />
* <span style="color:purple">'''4c.''' [[AUF]] and undo the set-up moves.</span><br />
<br />
== Simplifications ==<br />
<span style="color:red">'''1. 2x2x3:'''</span><br />
* Construct [[CFOP]]-style as a cross with two pairs, but without a fourth cross piece. This is generally frowned upon due to the nonuse of blockbuilding.<br />
<br />
<span style="color:orange">'''2. C+OP:'''</span><br />
* The solved edge is advised to be the FR edge, formed with the DFR corner as a [[CFOP]]-style pair.<br />
* It is acceptable from this point to solve with first layer on left, if the 2x2x3 block is positioned in the lower left side of the cube.<br />
* It is also acceptable to solve a row of pieces (e.g. DFR-DR-DBR) to complete <span style="color:orange">'''C+OP'''</span>.<br />
* [[Winter Variation]] and other techniques may be used to influence [[OCLL]] for the <span style="color:yellow">'''CLL'''</span> step.<br />
* Solving additional edges in this step or the next is advisable to influence the <span style="color:blue">'''LSE'''</span> step.<br />
<br />
<span style="color:yellow">'''3. CLL:'''</span><br />
* Influencing EO is highly advisable for preparation of the <span style="color:blue">'''LSE'''</span> step.<br />
<br />
<span style="color:blue">'''4. LSE:'''</span><br />
* "Hacking" LSE, or '''LSE hax''', is performed using alternate approaches to solving LSE that may include the use of [[Commutator|commutators]], [[ELL]] (and [[PLL#Permutations_of_Edges_Only|EPLL]] consequently), 5-cycles, and [[L5E]].<br />
<br />
== Pros ==<br />
Pikas**t allows for freer manipulations of the cube as compared to other more structured methods, particularly in the <span style="color:orange">'''C+OP'''</span> and <span style="color:yellow">'''CLL'''</span> steps.<br />
<br />
== Cons ==<br />
As can be expected with any pseudo- steps in a speedsolving method, recognising for <span style="color:blue">'''LSE'''</span> can be difficult, notably the EO supstep in <span style="color:green">'''4a'''</span>.<br />
<br />
Also, movecount can be considerably higher than other speedsolving methods for solvers unaccustomed to the style of Pikas**t.<br />
<br />
== See also ==<br />
* [[Petrus Method]]<br />
* [[Roux Method]]<br />
* [[CLL algorithms (3x3x3)]]<br />
* [[CMLL]]<br />
* [[OLLCP]]<br />
* [[Last Six Edges]]<br />
* [[L5E]]<br />
* [[ELL]]<br />
<br />
<br />
== External links ==<br />
<br />
* [http://www.speedsolving.com/forum/showthread.php?42671-Method-proposal-week-1-Pikas**t Justin (Cool Frog) Harder's original proposal of the method.] Example solves included.<br />
* [http://www.youtube.com/watch?v=RsFoLQ1qCbI Method overview by Ranzha V. Emodrach]<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 speedsolving methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=EOLine&diff=24768EOLine2014-09-30T16:17:56Z<p>Cubeboy9235: </p>
<hr />
<div>{{Substep Infobox<br />
|name=EOLine<br />
|image<br />
|proposers= [[Zbigniew Zborowski]]<br />
|year=2006<br />
|anames=<br />
|variants= [[Cross]]<br />
|subgroup=<br />
|algs=0<br />
|moves= 6.127<br />
|purpose=<br />
|previous=[[Scrambled cube state]]<br />
|next=[[EOline cube state]]<br />
}}<br />
<br />
The first and most important step of the [[ZZ Method]]. It involves orienting all 12 edges, while simultaneously placing the ''line edges'' (DF and DB). After the [[EO]] part, the cube is reduced to <R, U, L, D, F2, B2>. After placing DB and DF, the cube is reduced to <R, U, L>, meaning it can be solved completely by turning only the R, U and L layers.<br />
<br />
== Solving Procedure ==<br />
=== EO Detection ===<br />
Looking at the edges on the U face, D face, F face of the E-slice, and B face of the E-slice:<br />
* If the sticker has L/R color it's a bad edge.<br />
* If the sticker has F/B color, look at the sticker on the other side of the edge.<br />
: * If the side sticker has U/D color, it's a bad edge.<br />
<br />
=== Orienting 2 Bad Edges ===<br />
Place one bad edge on F/B using <R, U, L, D, F2, B2> and then do a F/B quarter turn. Repeat with Orienting 4+ bad edges approach.<br />
<br />
=== Orienting 4 + Bad Edges ===<br />
Place four bad edges on F/B using <R, U, L, D, F2, B2> and then do a F/B quarter turn. Repeat until there are no more bad edges.<br />
<br />
=== Orienting 6 Bad Edges ===<br />
Often, 6 bad edges can be oriented more efficiently by placing 3 bad edges into F/B using <R, U, L, D, F2, B2>, performing an F/B quarter turn, and then using the 4 + approach to correctly orient the remaining 4 bad edges.<br />
<br />
=== Solving the Line ===<br />
Place DF and DB in their solved positions using <R, U, L, D, F2, B2>.<br />
<br />
== EO+Line ==<br />
In order to improve ease of learning and simplify the planning step, beginners may treat EOLine as two steps - EO+Line. Using this approach only EO is planned during inspection. The solver looks-ahead for the line edges during EO execution to plan for placement of the line. Although sometimes a useful fallback for difficult EOLine cases, EO+Line causes the solver to focus on the line edges during the inital steps, rather than looking ahead for the first 1x2x2 block. This significantly reduces the likelyhood of a smooth transition from EOLine to F2L.<br />
<br />
== EOCross ==<br />
Sometimes, DL and DR are also solved before [[ZZF2L]] (3-gen [[F2L]]). This is known as EOCross. This practice is common among solvers making the transition from CFOP as it allows F2L to be solved in much the same way as before. Although useful for making the transition, using EOCross is generally regarded as slower than EOLine because it is extremely difficult to plan and execute as a single step, and also results in a significantly less efficient F2L. <br />
<br />
== External links ==<br />
* [http://cube.crider.co.uk/zz.php?p=eoline EOLine Tutorial] (text based)<br />
* [http://www.youtube.com/watch?v=a6tkUlkjnOE EOLine Tutorial] (youtube)<br />
<br />
== See also ==<br />
* [[ZZ Method]]<br />
* [[Edge Orientation]]<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 speedsolving methods]]<br />
[[Category:3x3x3 first substeps]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=FRED&diff=24767FRED2014-09-30T15:51:16Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Fred<br />
|image=<br />
|proposers=Baian Liu, Timothy Sun, Stachu Korick, ??<br />
|year=2006-10<br />
|anames=[[CPLS]]+[[2GLL]]<br />
|variants=[[ZB]]<br />
|steps=4<br />
|algs=110<br />
|purpose=<sup></sup><br />
* [[One-Handed]]<br />
* [[Speedsolving]]<br />
}}<br />
"Fred" is simply the name given to the LS+LL system of CPLS followed by 2GLL, rather than referencing to said method as "CPLS+2GLL."<br />
This page will be later updated with progress concerning the method.<br />
<br />
# Solve [[F2L]] apart from one slot<br />
# Do [[ELS]] or another method to solve FR and the EOLL.<br />
# Perform one of 26 algorithms to finish the F2L while reducing the LL to a 2-gen state<br />
# Solve the last layer with one of 84 algorithms<br />
<br />
== See also ==<br />
* [[CPLS]]<br />
* [[2GLL]]<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Belt_Method&diff=24766Belt Method2014-09-30T15:47:54Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Belt<br />
|image=Belt_method.gif<br />
|proposers=[[Denton Holder]]<br />
|year 2009<br />
|anames= Equator<br />
lvariants= 2 Look 3 Look 4Look<br />
|steps=7<br />
|moves=65+<br />
|purpose=<sup></sup><br />
* [[Speedsolving]]<br />
}}<br />
<br />
'''Belt Method''' (also known as '''Equator''' or '''Ring''') is a middle-layer-first method for the 3x3 proposed by Denton Holder. It and other middle-layer-first variants have been proposed a number of times, e.g. Ring Method in 2004 by Kyle Bryant.<br />
<br />
== Steps ==<br />
<br />
1. Solve the E-Slice<br />
<br />
2. Separate the remaining pieces into their respective layers. The corners and the edges are usually done separately, but the order varies. This can be done intuitively. <br />
<br />
3. Orient the U and D layer pieces. Doing this step in one look requires far too many algorithms, so it is normally done by first orienting the U layer, and then the D layer. OLL (57 algorithms) can be used for this, though a parity algorithm is needed. <br />
<br />
Corner Orientation Parity (To be repeated if it does not work): R U' R' U' R U R' U2 R U' R'<br />
<br />
Edge Orientation Parity (At least one unoriented edge in the M Layer): M' U M<br />
<br />
4. Permute U and D layer pieces. The one look version takes over 300 cases, so, once again, two look is much more practical. You first correct the parity error (which occurs 50% of the time), and then you use PLL (21 algorithms) on both layers to finish the cube. <br />
<br />
PLL Parity- M2 U2 M2<br />
<br />
== Variants ==<br />
<br />
There are many variants to the method described above. Instead of seperating, orienting and then permuting, you could change the order around. You can do orientation, seperation and then permutation. Another slightly different approach is to orient all edges, THEN solve the belt and continue on.<br />
<br />
<br />
<br />
== Conclusion ==<br />
<br />
Overall, Belt method has a reasonably large move count and is not as fast as other speed methods (CFOP, Roux, Petrus, CF etc.)<br />
However, it is a lot of fun and has been used to achieve sub-30.<br />
<br />
== See also ==<br />
* [[Human Thistlethwaite]]<br />
<br />
== External links ==<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=16959 3x3 Method - KwS] (a belt-style method)<br />
* Speedsolving.com : [http://www.speedsolving.com/forum/showthread.php?25419-Middle-layer-first-method Various Middle Layer First methods.]<br />
*Speedsolving.com : [http://www.speedsolving.com/forum/showthread.php?26875-Belt-Method Great description]<br />
<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=CFOP_method&diff=24765CFOP method2014-09-30T15:37:23Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=CFOP<br />
|image=Fridrich_method.gif<br />
|proposers=[[David Singmaster]]<br/>[[René Schoof]]<br/>[[Jessica Fridrich]]<br/>[[Hans Dockhorn]]<br/>[[Anneke Treep]]<br />
|year=1981<br />
|anames=CFOP<br />
|variants=[[CLL]]/[[ELL]], [[VH]], [[ZB]], [[MGLS-F]]<br />
|steps=4<br />
|algs=78 to 119 <br/>F2L:0 to 41<br/>LL: 78<br />
|moves=55<br />
|purpose=<sup></sup><br />
* [[Speedsolving]]<br />
* [[Speed BLD]]<br />
* [[One-Handed Solving]]<br />
* [[Solving with Feet]]<br />
}}<br />
<br />
'''CFOP''' (''Cross, F2L, OLL, PLL'', pronounced C-F-O-P or C-fop) is a 3x3 speedsolving method proposed by several cubers around 1981. It is also known as the '''Fridrich Method''' after its popularizer, [[Jessica Fridrich]]. In part due to Fridrich's publication of the method on her website in 1995, CFOP has been the most dominant 3x3 speedcubing method since around 2000, with it and its variants used by the vast majority of the top speedcubers.<br />
<br />
== Origin and Naming Dispute ==<br />
<br />
Jessica Fridrich is often erroneously credited as the sole inventor of CFOP. In reality, developments made in the early 80's by other cubers have contributed to the method in its current form. The constituent techniques and their original proposers are as follows:<br />
* [[Cross]]: [[David Singmaster]]<br />
* [[F2L]] (4x corner + edge pairs): [[René Schoof]] and possibly others<br />
* [[OLL]]/[[PLL]]: [[Hans Dockhorn]], [[Anneke Treep]], with many algorithms developed by [[Jessica Fridrich]]<br />
<br />
During the resurgence in speedcubing's popularity in the late 90s and early 2000s, there was a general lack of information on the sport. Fridrich's website offered a vast wealth of information for those entering the sport, including a full description of CFOP with complete lists of algorithms. As a result, many who learned from her website began to call this method "the Fridrich Method," which explains the common use of the term today.<br />
<br />
Several high-profile cubers have long disputed this terminology; [[Ron van Bruchem]], famously, has publicly written that he will never call CFOP "the Fridrich Method." The issue became well-advertised in the community around 2008. The term "CFOP" has since seen increasing usage, also in part motivated by efforts to standardize terminology in method classification, and is now seen as commonly as "Fridrich Method."<br />
<br />
While some cubers still insist on the term "CFOP," Fridrich's contribution to the popularization of the method is undeniable, and many others accept the term "Fridrich Method" as established terminology and a perfectly valid synonym for "CFOP."<br />
<br />
== The Steps ==<br />
W<br />
CFOP can be viewed as an advanced version of a [[Layer-By-Layer]] method. In particular, it combines some steps of the said method into one by using many more algorithms. Here, we outline pure CFOP without any additional trick.<br />
<br />
1. '''[[Cross]]'''<br />
Make a cross on one side by solving all edges of a given color. Align the edges with the second-layer centers.<br />
<br />
2. '''[[F2L]] (First Two Layers)'''<br />
Fill in the four '''slots''' between the cross pieces, one slot at a time. Each slot is filled by inserting a corner and its corresponding edge simultaneously. Most of the 41 cases have reasonable intuitive solutions. The completion of this step leaves one with just the last layer, typically placed on top.<br />
<br />
3. '''[[OLL]] (Orientation of the Last Layer)'''<br />
Make the entire top side (the last layer) of the cube a solid color. 57 nontrivial cases.<br />
<br />
4. '''[[PLL]] (Permutation of the Last Layer)'''<br />
Finally, you finish the cube by permuting the top layer of the cube. 21 nontrivial cases.<br />
<br />
== Simplifications ==<br />
Those new to OLL and PLL break up each step into two. This greatly reduces the number of cases; 2-look OLL has 9 cases, while 2-look PLL has 6.<br />
<br />
== Pros ==<br />
<br />
This method is relatively easy to understand when compared to other methods. Therefore, it is the most tested and most popular method used. It has a reasonable number of algorithms to learn, and sub 15 second averages are definitely possible. This method has been used to set many world records. It takes less thinking than block-building methods because it's more algorithm based.<br />
<br />
== Cons ==<br />
<br />
Learning all of the algorithms takes some time, and it requires a lot of practice to solve the F2L consistently in 10 seconds or less. Also, it has a slightly higher move count when compared to block building methods.<br />
<br />
== See also ==<br />
* [[Cross]]<br />
* [[XCross]]<br />
* [[F2L]]<br />
* [[OLL]]/[[PLL]]<br />
* [[CFCE]]<br />
<br />
<br />
{{F2L}}<br />
<br />
<br />
{{OLL}}<br />
<br />
<br />
{{PLL}}<br />
<br />
== External links ==<br />
<br />
* [http://solvethecube.110mb.com/ Joël van Noort's tutorial]<br />
* [http://erikku.er.funpic.org/rubik/Fridrich.html Erik Akkersdijk's tutorial]<br />
* [http://www.cubefreak.net/cfop/ Shotaro Makisumi's tutorial]<br />
* [http://www.ws.binghamton.edu/fridrich/cube.html Jessica's Homepage]<br />
* [http://www.youtube.com/watch?v=k-xbcAMfWwM Badmephisto's Intuitive F2L Tutorial]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=2322 Fridrich Method] - info on its origin.<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 speedsolving methods]]<br />
[[Category:SpeedBLD Methods]]<br />
[[Category:Acronyms]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=CFOP_method&diff=24764CFOP method2014-09-30T15:33:02Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=CFOP<br />
|image=Fridrich_method.gif<br />
|proposers=[[David Singmaster]]<br/>[[René Schoof]]<br/>[[Jessica Fridrich]]<br/>[[Hans Dockhorn]]<br/>[[Anneke Treep]]<br />
|year=1981<br />
|anames=CFOP<br />
|variants=[[CLL]]/[[ELL]], [[VH]], [[ZB]], [[MGLS-F]]<br />
|steps=4<br />
|algs=78 to 119 <br/>F2L:0 to 41<br/>LL: 78<br />
|moves=55<br />
|purpose=<sup></sup><br />
* [[Speedsolving]]<br />
* [[Speed BLD]]<br />
* [[One-Handed Solving]]<br />
* [[Solving with Feet]]<br />
}}<br />
<br />
'''CFOP''' (''Cross, F2L, OLL, PLL'', pronounced C-F-O-P or C-fop) is a 3x3 speedsolving method proposed by several cubers around 1981. It is also known as the '''Fridrich Method''' after its popularizer, [[Jessica Fridrich]]. In part due to Fridrich's publication of the method on her website in 1995, CFOP has been the most dominant 3x3 speedcubing method since around 2000, with it and its variants used by the vast majority of the top speedcubers.<br />
<br />
== Origin and Naming Dispute ==<br />
<br />
Jessica Fridrich is often erroneously credited as the sole inventor of CFOP. In reality, developments made in the early 80's by other cubers have contributed to the method in its current form. The constituent techniques and their original proposers are as follows:<br />
* [[Cross]]: [[David Singmaster]]<br />
* [[F2L]] (4x corner + edge pairs): [[René Schoof]] and possibly others<br />
* [[OLL]]/[[PLL]]: [[Hans Dockhorn]], [[Anneke Treep]], with many algorithms developed by [[Jessica Fridrich]]<br />
<br />
During the resurgence in speedcubing's popularity in the late 90s and early 2000s, there was a general lack of information on the sport. Fridrich's website offered a vast wealth of information for those entering the sport, including a full description of CFOP with complete lists of algorithms. As a result, many who learned from her website began to call this method "the Fridrich Method," which explains the common use of the term today.<br />
<br />
Several high-profile cubers have long disputed this terminology; [[Ron van Bruchem]], famously, has publicly written that he will never call CFOP "the Fridrich Method." The issue became well-advertised in the community around 2008. The term "CFOP" has since seen increasing usage, also in part motivated by efforts to standardize terminology in method classification, and is now seen as commonly as "Fridrich Method."<br />
<br />
While some cubers still insist on the term "CFOP," Fridrich's contribution to the popularization of the method is undeniable, and many others accept the term "Fridrich Method" as established terminology and a perfectly valid synonym for "CFOP."<br />
<br />
== The Steps ==<br />
<br />
CFOP can be viewed as an advanced version of a [[Layer-By-Layer]] method. In particular, it combines some steps of the said method into one by using many more algorithms. Here, we outline pure CFOP without any additional trick.<br />
<br />
1. '''[[Cross]]'''<br />
Make a cross on one side by solving all edges of a given color. Align the edges with the second-layer centers.<br />
<br />
2. '''[[F2L]] (First Two Layers)'''<br />
Fill in the four '''slots''' between the cross pieces, one slot at a time. Each slot is filled by inserting a corner and its corresponding edge simultaneously. Most of the 41 cases have reasonable intuitive solutions. The completion of this step leaves one with just the last layer, typically placed on top.<br />
<br />
3. '''[[OLL]] (Orientation of the Last Layer)'''<br />
Make the entire top side (the last layer) of the cube a solid color. 57 nontrivial cases.<br />
<br />
4. '''[[PLL]] (Permutation of the Last Layer)'''<br />
Finally, you finish the cube by permuting the top layer of the cube. 21 nontrivial cases.<br />
<br />
== Simplifications ==<br />
Those new to OLL and PLL break up each step into two. This greatly reduces the number of cases; 2-look OLL has 9 cases, while 2-look PLL has 6.<br />
<br />
== Pros ==<br />
<br />
This method is relatively easy to understand when compared to other methods. Therefore, it is the most tested and most popular method used. It has a reasonable number of algorithms to learn, and sub 15 second averages are definitely possible. This method has been used to set many world records. It takes less thinking than block-building methods because it's more algorithm based.<br />
<br />
== Cons ==<br />
<br />
Learning all of the algorithms takes some time, and it requires a lot of practice to solve the F2L consistently in 10 seconds or less. Also, it has a slightly higher move count when compared to block building methods.<br />
<br />
== See also ==<br />
* [[Cross]]<br />
* [[XCross]]<br />
* [[F2L]]<br />
* [[OLL]]/[[PLL]]<br />
<br />
<br />
{{F2L}}<br />
<br />
<br />
{{OLL}}<br />
<br />
<br />
{{PLL}}<br />
<br />
== External links ==<br />
<br />
* [http://solvethecube.110mb.com/ Joël van Noort's tutorial]<br />
* [http://erikku.er.funpic.org/rubik/Fridrich.html Erik Akkersdijk's tutorial]<br />
* [http://www.cubefreak.net/cfop/ Shotaro Makisumi's tutorial]<br />
* [http://www.ws.binghamton.edu/fridrich/cube.html Jessica's Homepage]<br />
* [http://www.youtube.com/watch?v=k-xbcAMfWwM Badmephisto's Intuitive F2L Tutorial]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=2322 Fridrich Method] - info on its origin.<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 speedsolving methods]]<br />
[[Category:SpeedBLD Methods]]<br />
[[Category:Acronyms]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Snyder_Method&diff=24763Snyder Method2014-09-30T15:27:07Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Snyder<br />
|image=Snyder.png<br />
|proposers=[[Anthony Snyder]]<br />
|year=1982<br />
|anames=<br />
|variants=[[Heise Method]]<br />
[[Petrus]]<br />
|steps=3-5<br />
|moves=40<br />
|purpose=<sup></sup><br />
*[[Speedsolving]]<br />
*[[FMC]]<br />
}}<br />
The '''Snyder Method''', invented by [[Anthony Snyder]] in 1982, is both a [[fewest moves]] and a [[speedsolving]] [[method]] for the [[3x3x3 cube]]. The start is similar to [[Petrus]], forming a 2x2x2 block with optional [[XCross]]. Then a variety of methods may be used to complete the rest of the F2L except for one CE. (Anthony has since added optional starts using a 1x2x3 or a 2x2x3, also with or without the cross.) Then the final CE pair is placed while simultaneously orienting and placing a minimum of one LLE. Then all LL edges are solved together with one corner. Then the [[last three corners]] are solved.<br />
<br />
== Claimed advantages ==<br />
A salient characteristic of the Snyder Method is to orient and permute each piece at each stage simultaneously. Anthony claims several advantages for this:<br />
* Simultaneous orientation and permutation helps to visualize piece relationships, useful to intuitive solving.<br />
* There is a mathematical advantage.<br />
Furthermore, all such last-layer algorithms will be a subset of [[1LLL]], making the Snyder Method a possible candidate as an intermediate method for [[1LLL]].<br />
<br />
Though there are many cases to first solving the LLE+1C, the more common cases can generally be solved in 6-10 turns, making it quite turn efficient.<br />
<br />
Although the Snyder Method closely resembles the [[Petrus Method]] in its F2L approach, its last-layer method differs considerably. This last-layer method was independently proposed in 2005 by [[Kenneth Gustavsson]], who called it "Fish & Chips."<br />
<br />
== A word about algorithms ==<br />
Anthony found almost all of his algorithms independently and without computer aid, and claims that his method is one of the most efficient based primarily on human-generated algorithms. Anthony explained this as follows: "In the 80's there was a general stereotype that using a computer was cheating, plus [I] enjoyed thinking up [my] own algorithms." However, he plans to upgrade his method using a computer in the near future.<br />
<br />
== Variations ==<br />
The Snyder Method allows a number of variations to be applied wherever convenient.<br />
* when a 2x2x3 block is not immediately apparent he will start with either a 1x2x3 or a 2x2x2, then immediately finish the 2x2x3 block with a second look, or, he puts together several CE pairs as in [[Heise]], then assembles those into a F2L minus one CE<br />
* two or more CE may be solved simultaneously to complete the F2L faster<br />
* the LL may be solved in 1 look rather than 2, using either a shortest-move algorithm, combination, or substitution<br />
<br />
In the early 80's, Anthony developed a complete set of fewest-move solutions for the CE pair cases and for the [[last three corners]] cases. However, he relied more extensively on the use of combinations and exchanges to efficiently put in the LL edges + corner. He makes up for this with a large selection of approximate direct-solves on the entire LL, claiming to switch to this mode about 20% of the time.<br />
<br />
This method requires 1-2 looks for the block+cross start, then up to 1 look each for the 1-3 CE pairs, then 1-2 looks for the last layer. Though there are a lot of looks, an attentive solver can be quite efficient, and average around 40 turns. Though a beginner will likely take a lot more than this, and a pro taking their time may get his/her average down to about 36. Many of the shorter algorithms were added throughout the 80's and 90's, and the library of LL direct solves were mostly added in the 00's.<br />
<br />
== Publication ==<br />
In 1981 he printed his simple solution, a 7 algorithm system that is easy to learn. It was entitled, "Tony Snyder's Simplest Solution to Solve a Rubik's Cube", and though he personally only taught a handful of people this technique, a classmate took a copy and passed it out to students in a number of schools. He has not yet put to print his advanced technique.<br />
<br />
<small>'''Note:''' Having complete sets of short algorithms was very unusual in the 1980s (combining 2 algs in 1-look was a common solution). [[Kenneth Gustavsson]] suggested the same LL-method ('Fish & Chips') in 2005 but with [[VHF2L]] and the rest in two clearly defined steps, [[EP]] + 1 corner (36 cases, the 'fish' step) and then [[L3C]] (22 cases, the 'chips' step), this makes a 2-look [[ZBLL]], often a little more effective than [[COLL]]/[[EPLL]].</small><br />
<br />
== Example solves ==<br />
Here are some of Anthony's solves.<br />
* [http://www.youtube.com/watch?v=UB2Pb9_iNBI The Snyder Method]<br />
* [http://www.youtube.com/watch?v=fra6go0CMgI A newer demo, easier to see]<br />
* [http://www.youtube.com/watch?v=HEKjAHDyKLo 5 solves using Snyder Method 2, showing how fast it is despite his handicaps].<br />
<br />
== See also ==<br />
* [[Anthony Snyder]]<br />
* [[Snyder Notation]]<br />
* [[Snyder Metric]]<br />
* [[Heise Method]]<br />
* [[Petrus Method]]<br />
* [[L3C]]<br />
<br />
If you have edges oriented when starting the last layer you can often do using only Sune, double Sune (or inverse and/or mirrors), J-PLL a/b or U-PLL a/b for the first look. Here are a couple of examples that show how this is done:<br />
<br />
'''Scramble''' '''Solution'''<br />
F U F' L2 B' U' B U L2 F U' F' U AUF to U-PLL a on the left side, (L3C 3-twist).<br />
L' U R U' B2 U' B2 U B2 R' L U' AUF J-PLL b, (L3C 'Anti Niklas')<br />
B' F R2 U' R2 U R2 U F' U' B U' J-PLL b, (L3C Niklas)<br />
R2 F2 R2 U R' F2 R U' R2 F2 R U R U left side double Antisune (L' U2 L U...)<br />
R' F U2 F U L' U L F U' F U F R U2 left side double Antisune (again!)<br />
B L2 F' D F' D' F2 L2 B' U' y J-PLL a (setup L' before the y for [[1LLL]])<br />
L U2 L D' B2 D L' U2 L D' B2 D L2 U' y2 left Antisune.<br />
<br />
Sometimes more than one of these solutions are possible. Working like this solves the step in an easy 2:5 times, maybe more. It is effective, fast and OH-friendly, but recogniton for the sune/doublesune cases is horrible without loads of practice. For the cases where two opposite edges needs to be swapped [[COLL]] is a recommended alternative and for the cases with edges correct, one or two look [[L4C]].<br />
<br />
== External links ==<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?24822-Tony-Snyder-solves-the-cube Tony Snyder solves the cube]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=633439&viewfull=1#post633439 Reconstructions]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=714631#post714631 Five more reconstructions]<br />
* blog.naver.com (korean, 3LLE+1C): [http://blog.naver.com/dmdrlrndk/90192057323] [http://blog.naver.com/dmdrlrndk/90192057379] [http://blog.naver.com/dmdrlrndk/90192057422] [http://blog.naver.com/dmdrlrndk/90192057468]<br />
<br />
[[Category:Advanced Methods]]<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 speedsolving methods]]<br />
[[Category:Fewest Moves Methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24762Hahn Method2014-09-30T15:25:01Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants=[[Petrus]]<br />
|steps=4<br />
|moves=40<br />
|purpose=<sup></sup><br />
*[[Speedsolving]] <br />
*[[FMC]]<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
==See also==<br />
<sup></sup><br />
*[[Blockbuilding]]<br />
*[[Petrus Method]]<br />
*[[L4C]]<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use [[keyhole]] with two or one-pair techniques from [[Heise]] <br />
method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Snyder_Method&diff=24761Snyder Method2014-09-30T15:14:32Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Snyder<br />
|image=Snyder.png<br />
|proposers=[[Anthony Snyder]]<br />
|year=1982<br />
|anames=<br />
|variants=[[Heise Method]]<br />
[[Petrus]]<br />
|steps=3-5<br />
|moves=40<br />
|purpose=<sup></sup><br />
* [[Speedsolving]] [[FMC]]<br />
}}<br />
The '''Snyder Method''', invented by [[Anthony Snyder]] in 1982, is both a [[fewest moves]] and a [[speedsolving]] [[method]] for the [[3x3x3 cube]]. The start is similar to [[Petrus]], forming a 2x2x2 block with optional [[XCross]]. Then a variety of methods may be used to complete the rest of the F2L except for one CE. (Anthony has since added optional starts using a 1x2x3 or a 2x2x3, also with or without the cross.) Then the final CE pair is placed while simultaneously orienting and placing a minimum of one LLE. Then all LL edges are solved together with one corner. Then the [[last three corners]] are solved.<br />
<br />
== Claimed advantages ==<br />
A salient characteristic of the Snyder Method is to orient and permute each piece at each stage simultaneously. Anthony claims several advantages for this:<br />
* Simultaneous orientation and permutation helps to visualize piece relationships, useful to intuitive solving.<br />
* There is a mathematical advantage.<br />
Furthermore, all such last-layer algorithms will be a subset of [[1LLL]], making the Snyder Method a possible candidate as an intermediate method for [[1LLL]].<br />
<br />
Though there are many cases to first solving the LLE+1C, the more common cases can generally be solved in 6-10 turns, making it quite turn efficient.<br />
<br />
Although the Snyder Method closely resembles the [[Petrus Method]] in its F2L approach, its last-layer method differs considerably. This last-layer method was independently proposed in 2005 by [[Kenneth Gustavsson]], who called it "Fish & Chips."<br />
<br />
== A word about algorithms ==<br />
Anthony found almost all of his algorithms independently and without computer aid, and claims that his method is one of the most efficient based primarily on human-generated algorithms. Anthony explained this as follows: "In the 80's there was a general stereotype that using a computer was cheating, plus [I] enjoyed thinking up [my] own algorithms." However, he plans to upgrade his method using a computer in the near future.<br />
<br />
== Variations ==<br />
The Snyder Method allows a number of variations to be applied wherever convenient.<br />
* when a 2x2x3 block is not immediately apparent he will start with either a 1x2x3 or a 2x2x2, then immediately finish the 2x2x3 block with a second look, or, he puts together several CE pairs as in [[Heise]], then assembles those into a F2L minus one CE<br />
* two or more CE may be solved simultaneously to complete the F2L faster<br />
* the LL may be solved in 1 look rather than 2, using either a shortest-move algorithm, combination, or substitution<br />
<br />
In the early 80's, Anthony developed a complete set of fewest-move solutions for the CE pair cases and for the [[last three corners]] cases. However, he relied more extensively on the use of combinations and exchanges to efficiently put in the LL edges + corner. He makes up for this with a large selection of approximate direct-solves on the entire LL, claiming to switch to this mode about 20% of the time.<br />
<br />
This method requires 1-2 looks for the block+cross start, then up to 1 look each for the 1-3 CE pairs, then 1-2 looks for the last layer. Though there are a lot of looks, an attentive solver can be quite efficient, and average around 40 turns. Though a beginner will likely take a lot more than this, and a pro taking their time may get his/her average down to about 36. Many of the shorter algorithms were added throughout the 80's and 90's, and the library of LL direct solves were mostly added in the 00's.<br />
<br />
== Publication ==<br />
In 1981 he printed his simple solution, a 7 algorithm system that is easy to learn. It was entitled, "Tony Snyder's Simplest Solution to Solve a Rubik's Cube", and though he personally only taught a handful of people this technique, a classmate took a copy and passed it out to students in a number of schools. He has not yet put to print his advanced technique.<br />
<br />
<small>'''Note:''' Having complete sets of short algorithms was very unusual in the 1980s (combining 2 algs in 1-look was a common solution). [[Kenneth Gustavsson]] suggested the same LL-method ('Fish & Chips') in 2005 but with [[VHF2L]] and the rest in two clearly defined steps, [[EP]] + 1 corner (36 cases, the 'fish' step) and then [[L3C]] (22 cases, the 'chips' step), this makes a 2-look [[ZBLL]], often a little more effective than [[COLL]]/[[EPLL]].</small><br />
<br />
== Example solves ==<br />
Here are some of Anthony's solves.<br />
* [http://www.youtube.com/watch?v=UB2Pb9_iNBI The Snyder Method]<br />
* [http://www.youtube.com/watch?v=fra6go0CMgI A newer demo, easier to see]<br />
* [http://www.youtube.com/watch?v=HEKjAHDyKLo 5 solves using Snyder Method 2, showing how fast it is despite his handicaps].<br />
<br />
== See also ==<br />
* [[Anthony Snyder]]<br />
* [[Snyder Notation]]<br />
* [[Snyder Metric]]<br />
* [[Heise Method]]<br />
* [[Petrus Method]]<br />
* [[L3C]]<br />
<br />
If you have edges oriented when starting the last layer you can often do using only Sune, double Sune (or inverse and/or mirrors), J-PLL a/b or U-PLL a/b for the first look. Here are a couple of examples that show how this is done:<br />
<br />
'''Scramble''' '''Solution'''<br />
F U F' L2 B' U' B U L2 F U' F' U AUF to U-PLL a on the left side, (L3C 3-twist).<br />
L' U R U' B2 U' B2 U B2 R' L U' AUF J-PLL b, (L3C 'Anti Niklas')<br />
B' F R2 U' R2 U R2 U F' U' B U' J-PLL b, (L3C Niklas)<br />
R2 F2 R2 U R' F2 R U' R2 F2 R U R U left side double Antisune (L' U2 L U...)<br />
R' F U2 F U L' U L F U' F U F R U2 left side double Antisune (again!)<br />
B L2 F' D F' D' F2 L2 B' U' y J-PLL a (setup L' before the y for [[1LLL]])<br />
L U2 L D' B2 D L' U2 L D' B2 D L2 U' y2 left Antisune.<br />
<br />
Sometimes more than one of these solutions are possible. Working like this solves the step in an easy 2:5 times, maybe more. It is effective, fast and OH-friendly, but recogniton for the sune/doublesune cases is horrible without loads of practice. For the cases where two opposite edges needs to be swapped [[COLL]] is a recommended alternative and for the cases with edges correct, one or two look [[L4C]].<br />
<br />
== External links ==<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?24822-Tony-Snyder-solves-the-cube Tony Snyder solves the cube]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=633439&viewfull=1#post633439 Reconstructions]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=714631#post714631 Five more reconstructions]<br />
* blog.naver.com (korean, 3LLE+1C): [http://blog.naver.com/dmdrlrndk/90192057323] [http://blog.naver.com/dmdrlrndk/90192057379] [http://blog.naver.com/dmdrlrndk/90192057422] [http://blog.naver.com/dmdrlrndk/90192057468]<br />
<br />
[[Category:Advanced Methods]]<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 speedsolving methods]]<br />
[[Category:Fewest Moves Methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24760Hahn Method2014-09-30T15:13:06Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants=[[Petrus]]<br />
|steps=4<br />
|moves=40<br />
<br />
|purpose= [[Speedsolving]] and [[FMC]]<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24759Hahn Method2014-09-30T15:11:29Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants=Petrus<br />
|steps=4<br />
|moves=40<br />
<br />
|purpose= [[Speedsolving]] and [[Fewest Moves]]<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24758Hahn Method2014-09-30T15:10:12Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants=Petrus<br />
|steps=4<br />
|moves=40<br />
<br />
|purpose= [[Speedsolving]] [[Fewest Moves]]<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24757Hahn Method2014-09-30T15:08:44Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants=Petrus<br />
|steps=4<br />
|moves=40 est.<br />
<br />
|purpose= [[Speedsolving]]<br />
= [[Fewest Moves]]<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Layer_by_layer&diff=24756Layer by layer2014-09-30T15:05:31Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=LBL (3x3x3)<br />
|image=Layer_by_layer.gif<br />
|proposers=none<br />
|year=1980s<br />
|anames<br />
|variants=[[CFOP]], [[8355]]<br />
|steps=5+<br />
|algs=6 to 16 (depending on [[LL]])<br />
|moves=100+<br />
|purpose=<sup></sup><br />
* [[Beginner method]]<br />
* [[Speedsolving]]<br />
}}<br />
'''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.<br />
<br />
__NOTOC__<br />
<br clear="right"><br />
== 3x3x3 LBL Method ==<br />
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.<br />
<br />
== 2x2x2 LBL Method ==<br />
{{Method Infobox<br />
|name=LBL (2x2x2)<br />
|image=Lbl.gif<br />
|proposers=none<br />
|year=1980s<br />
|anames<br />
|variants=[[CLL]]<br />
|steps=3<br />
|algs=2 to 9 (depending on [[LL]])<br />
|moves<br />
|purpose=<sup></sup><br />
* [[Beginner Method]]<br />
* [[Speedsolving]]<br />
}}<br />
<br />
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:<br />
<br />
* Orientation followed by Permutation<br />
* Permutation followed by Orientation<br />
<br />
==See also==<br />
* [[LOL]]<br />
* [[OLL]]<br />
* [[PLL]]<br />
* [[OLL (2x2x2)]]<br />
* [[Layer]]<br />
* [[First Layer]]<br />
* [[Last Layer]]<br />
* [[4-Look Last Layer]]<br />
<br />
== External links ==<br />
* YouTube: [http://www.youtube.com/user/CubeRight#p/u/8/VVrOmmKnVjo CubeRight's] excellent (HD) beginner tutorial. Easy transition to Fridrich method.<br />
* YouTube: [http://www.youtube.com/watch?v=609nhVzg-5Q Badmephiosto's Beginners Tutorial] excellent quality tutorial. Method designed for easy transition to Fridrich<br />
* YouTube: [http://ca.youtube.com/watch?v=ofZFUgaxlTQ Badmephisto's OLD Beginners Tutorial] .. the outdated version.<br />
* 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<br />
* [http://www.rubiksplace.com Beginners solution with animations] Excellent tutorial at www.rubiksplace.com<br />
* [http://www.monkeysee.com/play/1113-solve-rubik-s-cube Bob Burton's Tutorial] (video)<br />
* [http://www.rubiks.com/Academy/Tyson%20Video.aspx Tyson Mao's video tutorial on rubiks.com] (video)<br />
* [http://www.stanford.edu/~leyanlo/cube_solution.pdf Leyan's guide for beginners] '''(PDF)'''<br />
* [http://peter.stillhq.com/jasmine/rubikscubesolution.html Jasmine Lee's Beginner Solution]<br />
* [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)<br />
* [http://erikku.110mb.com/beginner.html Arnaud van Galen's beginners method explained by Erik Akkersdijk]<br />
* [http://rubikscube.info/beginner.php rubikscube.info Beginner LBL for the 2x2x2]<br />
* [http://joshtime.com/cubing/beginners-method/ JoshTime's Multiple Page LBL Beginner's Method Explanation]<br />
<br />
<br />
[[Category:2x2x2 beginner methods]]<br />
[[Category:3x3x3 beginner methods]]<br />
[[Category:2x2x2 speedsolving methods]]<br />
[[Category:3x3x3 speedsolving methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24754Hahn Method2014-09-29T10:08:30Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants=Petrus<br />
|steps=4<br />
|moves=40 est.<br />
<br />
|purpose= Fewest Moves<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Snyder_Method&diff=24753Snyder Method2014-09-29T09:05:39Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Snyder<br />
|image=Snyder.png<br />
|proposers=[[Anthony Snyder]]<br />
|year=1982<br />
|anames=<br />
|variants=[[Heise Method]]<br />
[[Petrus]]<br />
|steps=3-5<br />
|moves=35 est.<br />
|purpose=<sup></sup><br />
* [[Speedsolving]] [[FMC]]<br />
}}<br />
The '''Snyder Method''', invented by [[Anthony Snyder]] in 1982, is both a [[fewest moves]] and a [[speedsolving]] [[method]] for the [[3x3x3 cube]]. The start is similar to [[Petrus]], forming a 2x2x2 block with optional [[XCross]]. Then a variety of methods may be used to complete the rest of the F2L except for one CE. (Anthony has since added optional starts using a 1x2x3 or a 2x2x3, also with or without the cross.) Then the final CE pair is placed while simultaneously orienting and placing a minimum of one LLE. Then all LL edges are solved together with one corner. Then the [[last three corners]] are solved.<br />
<br />
== Claimed advantages ==<br />
A salient characteristic of the Snyder Method is to orient and permute each piece at each stage simultaneously. Anthony claims several advantages for this:<br />
* Simultaneous orientation and permutation helps to visualize piece relationships, useful to intuitive solving.<br />
* There is a mathematical advantage.<br />
Furthermore, all such last-layer algorithms will be a subset of [[1LLL]], making the Snyder Method a possible candidate as an intermediate method for [[1LLL]].<br />
<br />
Though there are many cases to first solving the LLE+1C, the more common cases can generally be solved in 6-10 turns, making it quite turn efficient.<br />
<br />
Although the Snyder Method closely resembles the [[Petrus Method]] in its F2L approach, its last-layer method differs considerably. This last-layer method was independently proposed in 2005 by [[Kenneth Gustavsson]], who called it "Fish & Chips."<br />
<br />
== A word about algorithms ==<br />
Anthony found almost all of his algorithms independently and without computer aid, and claims that his method is one of the most efficient based primarily on human-generated algorithms. Anthony explained this as follows: "In the 80's there was a general stereotype that using a computer was cheating, plus [I] enjoyed thinking up [my] own algorithms." However, he plans to upgrade his method using a computer in the near future.<br />
<br />
== Variations ==<br />
The Snyder Method allows a number of variations to be applied wherever convenient.<br />
* when a 2x2x3 block is not immediately apparent he will start with either a 1x2x3 or a 2x2x2, then immediately finish the 2x2x3 block with a second look, or, he puts together several CE pairs as in [[Heise]], then assembles those into a F2L minus one CE<br />
* two or more CE may be solved simultaneously to complete the F2L faster<br />
* the LL may be solved in 1 look rather than 2, using either a shortest-move algorithm, combination, or substitution<br />
<br />
In the early 80's, Anthony developed a complete set of fewest-move solutions for the CE pair cases and for the [[last three corners]] cases. However, he relied more extensively on the use of combinations and exchanges to efficiently put in the LL edges + corner. He makes up for this with a large selection of approximate direct-solves on the entire LL, claiming to switch to this mode about 20% of the time.<br />
<br />
This method requires 1-2 looks for the block+cross start, then up to 1 look each for the 1-3 CE pairs, then 1-2 looks for the last layer. Though there are a lot of looks, an attentive solver can be quite efficient, and average around 40 turns. Though a beginner will likely take a lot more than this, and a pro taking their time may get his/her average down to about 36. Many of the shorter algorithms were added throughout the 80's and 90's, and the library of LL direct solves were mostly added in the 00's.<br />
<br />
== Publication ==<br />
In 1981 he printed his simple solution, a 7 algorithm system that is easy to learn. It was entitled, "Tony Snyder's Simplest Solution to Solve a Rubik's Cube", and though he personally only taught a handful of people this technique, a classmate took a copy and passed it out to students in a number of schools. He has not yet put to print his advanced technique.<br />
<br />
<small>'''Note:''' Having complete sets of short algorithms was very unusual in the 1980s (combining 2 algs in 1-look was a common solution). [[Kenneth Gustavsson]] suggested the same LL-method ('Fish & Chips') in 2005 but with [[VHF2L]] and the rest in two clearly defined steps, [[EP]] + 1 corner (36 cases, the 'fish' step) and then [[L3C]] (22 cases, the 'chips' step), this makes a 2-look [[ZBLL]], often a little more effective than [[COLL]]/[[EPLL]].</small><br />
<br />
== Example solves ==<br />
Here are some of Anthony's solves.<br />
* [http://www.youtube.com/watch?v=UB2Pb9_iNBI The Snyder Method]<br />
* [http://www.youtube.com/watch?v=fra6go0CMgI A newer demo, easier to see]<br />
* [http://www.youtube.com/watch?v=HEKjAHDyKLo 5 solves using Snyder Method 2, showing how fast it is despite his handicaps].<br />
<br />
== See also ==<br />
* [[Anthony Snyder]]<br />
* [[Snyder Notation]]<br />
* [[Snyder Metric]]<br />
* [[Heise Method]]<br />
* [[Petrus Method]]<br />
* [[L3C]]<br />
<br />
If you have edges oriented when starting the last layer you can often do using only Sune, double Sune (or inverse and/or mirrors), J-PLL a/b or U-PLL a/b for the first look. Here are a couple of examples that show how this is done:<br />
<br />
'''Scramble''' '''Solution'''<br />
F U F' L2 B' U' B U L2 F U' F' U AUF to U-PLL a on the left side, (L3C 3-twist).<br />
L' U R U' B2 U' B2 U B2 R' L U' AUF J-PLL b, (L3C 'Anti Niklas')<br />
B' F R2 U' R2 U R2 U F' U' B U' J-PLL b, (L3C Niklas)<br />
R2 F2 R2 U R' F2 R U' R2 F2 R U R U left side double Antisune (L' U2 L U...)<br />
R' F U2 F U L' U L F U' F U F R U2 left side double Antisune (again!)<br />
B L2 F' D F' D' F2 L2 B' U' y J-PLL a (setup L' before the y for [[1LLL]])<br />
L U2 L D' B2 D L' U2 L D' B2 D L2 U' y2 left Antisune.<br />
<br />
Sometimes more than one of these solutions are possible. Working like this solves the step in an easy 2:5 times, maybe more. It is effective, fast and OH-friendly, but recogniton for the sune/doublesune cases is horrible without loads of practice. For the cases where two opposite edges needs to be swapped [[COLL]] is a recommended alternative and for the cases with edges correct, one or two look [[L4C]].<br />
<br />
== External links ==<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?24822-Tony-Snyder-solves-the-cube Tony Snyder solves the cube]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=633439&viewfull=1#post633439 Reconstructions]<br />
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=714631#post714631 Five more reconstructions]<br />
* blog.naver.com (korean, 3LLE+1C): [http://blog.naver.com/dmdrlrndk/90192057323] [http://blog.naver.com/dmdrlrndk/90192057379] [http://blog.naver.com/dmdrlrndk/90192057422] [http://blog.naver.com/dmdrlrndk/90192057468]<br />
<br />
[[Category:Advanced Methods]]<br />
[[Category:3x3x3 methods]]<br />
[[Category:3x3x3 speedsolving methods]]<br />
[[Category:Fewest Moves Methods]]</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24752Hahn Method2014-09-29T09:01:52Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants=Petrus<br />
|steps=4<br />
|moves=35 est.<br />
<br />
|purpose= Fewest Moves<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24751Hahn Method2014-09-29T09:00:36Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants<br />
|steps=4<br />
|moves=35 est.<br />
<br />
|purpose= Fewest Moves<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[L4C]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24750Hahn Method2014-09-29T08:59:24Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants<br />
|steps=4<br />
|moves=35 est.<br />
<br />
|purpose= Fewest Moves<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[CLL]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24749Hahn Method2014-09-29T08:57:24Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants<br />
|steps=4<br />
lalgorithms=84 <br />
|moves=35 est.<br />
|purpose= Fewest Moves<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[CLL]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235https://www.speedsolving.com/wiki/index.php?title=Hahn_Method&diff=24748Hahn Method2014-09-29T08:55:01Z<p>Cubeboy9235: </p>
<hr />
<div>{{Method Infobox<br />
|name=Hahn Method<br />
|image=keyhole.jpg <br />
|proposers=[[Eric Hahn]]<br />
|year=2010<br />
|anames<br />
|variants<br />
|steps=4<br />
algorithms=84 <br />
|moves=35 .est<br />
|purpose= Fewest Moves<br />
}}<br />
<br />
The '''Hahn Method''' is a [[blockbuilding]] and intuitive [[keyhole]] based method. First build a 2x2x3 block then add one edge at the bottom and one edge at the left side. Next use the keyhole for placing every edge and two corners into position. The last step is to solve the remaining corners with [[CLL]].<br />
<br />
== Steps ==<br />
<br />
1. Build a 2x2x3 block leaving the F and U faces free<br />
<br />
2. Add the FD and FL edge pieces<br />
<br />
3. Use keyhole with two- or one-pair techniques from heise method to solve the remaining 5 edges and the UFL and UFR corners<br />
<br />
4. Use an x rotation and solve the 4 remaining corners using [[L4C]].<br />
<br />
[[Category:3x3x3 methods]]<br />
[[Category:Experimental methods]]<br />
{{Stub}}</div>Cubeboy9235