Speedsolving.com Wiki - User contributions [en]

Edges First

2013-02-17T15:02:57Z

Flourishfrieder: /* External links */

{{Method Infobox
|name=Edges First
|image=edges_first.gif
|proposers=none
|year=1980s
|anames
|variants=[[8355]]
|steps=2
|moves
|purpose=
* [[Beginner Method]]
* [[Fewest Moves]]
}}

'''Edges first''', or just '''EF''', is a [[method]] where all [[edge]]s of the cube are solved before the [[corner]]s.

EF is not well suited for advanced [[speedsolving]], the first step is very easy but the corners needs a unplesant number of moves to be solved after that in most cases. In [[FMC]], when the time to [[look ahead]] is of no or little importance it is useful if many corners can be solved together with the edges, then it may be only one or possibly two corners cycles left in the end, that may be solved using insert algorithms.

== Substeps (as a beginner method) ==
* Solve the cross
* Solve 3 E layer edges
* Orient and (then) permute the last layer edges while solving the last E layer edge. This can be done intuitivly
* Rotate the cube so you have at least 2 D layer corners in the D layer and on FUR another D layer corner
* Use RUR'U' (Sexy Move) and D setup moves to solve 3 corners of the D layer. Be sure to use the unsolved corner to fix the edges that may have been affected by the sexy move (if it was not done 3 OR 6 times)
* Turn the cube over so that the 3/4 solved layer is now on top and the unsolved corner is on FUR
* Again use RUR'U' and D setup moves to solve the rest of the corners
* Parity: If the D layer is solved but not the cube you have parity. Repeat sexy move untill the cube is solved exept for 2 corners
* Hold the 2 Corners in D layer and solve them using RUR'U'

== Conclusion ==
The method only needs the sexy move as an algorithm, but it is needed a lot of intuition and knowlegde about the cube. As a speedsolving method though, its move count is way to high.

== External links ==
* [http://www.youtube.com/watch?v=uaul8AbhePc YouTube Tutorial]

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

{{Stub}}

Belt Method

2013-02-14T13:54:09Z

Flourishfrieder: /* Steps */

{{Method Infobox
|name=Belt
|image=Belt_method.gif
|proposers=Denton Holder
|year 2009
|anames=Equator
|variants= 2 Look 3 Look 4Look
|steps 7
|moves
|purpose=
* [[Speedsolving]]
}}

'''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.

== Steps ==

1. Solve the E-Slice

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.

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.

Corner Orientation Parity (To be repeated if it does not work): R U' R' U' R U R' U2 R U' R'

Edge Orientation Parity (At least one unoriented edge in the M Layer): M' U M

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.

PLL Parity- M2 U2 M2

== Variants ==

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.

== Conclusion ==

Overall, Belt method has a reasonably large move count and is not as fast as other speed methods (CFOP, Roux, Petrus, CF etc.)
However, it is a lot of fun and has been used to achieve sub-30.

== See also ==
* [[Human Thistlethwaite]]

== External links ==
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=16959 3x3 Method - KwS] (a belt-style method)
* Speedsolving.com : [http://www.speedsolving.com/forum/showthread.php?25419-Middle-layer-first-method Various Middle Layer First methods.]
*Speedsolving.com : [http://www.speedsolving.com/forum/showthread.php?26875-Belt-Method Great description]

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

{{Stub}}

Belt Method

2013-02-14T13:53:15Z

Flourishfrieder: /* Steps */

{{Method Infobox
|name=Belt
|image=Belt_method.gif
|proposers=Denton Holder
|year 2009
|anames=Equator
|variants= 2 Look 3 Look 4Look
|steps 7
|moves
|purpose=
* [[Speedsolving]]
}}

'''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.

== Steps ==

1. Solve the E-Slice

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.

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.

Corner Orientation Parity (To be repeated if it does not work): R U' R' U' R U R' U2 R U' R'
Edge Orientation Parity (At least one unoriented edge in the M Layer): M' U M

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.

PLL Parity- M2 U2 M2

== Variants ==

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.

== Conclusion ==

Overall, Belt method has a reasonably large move count and is not as fast as other speed methods (CFOP, Roux, Petrus, CF etc.)
However, it is a lot of fun and has been used to achieve sub-30.

== See also ==
* [[Human Thistlethwaite]]

== External links ==
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=16959 3x3 Method - KwS] (a belt-style method)
* Speedsolving.com : [http://www.speedsolving.com/forum/showthread.php?25419-Middle-layer-first-method Various Middle Layer First methods.]
*Speedsolving.com : [http://www.speedsolving.com/forum/showthread.php?26875-Belt-Method Great description]

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

{{Stub}}