Speedsolving.com Wiki - User contributions [en]

Roux method

2018-02-27T00:10:21Z

Runnerboy1008: petrus was spelled wrong

{{Method Infobox
|name=Roux
|image=Roux_method.gif
|proposers=[[Gilles Roux]]
|year=2003
|anames
|variants
|steps=4
|algs=9-42
|moves=[[Speedsolving|Speed]]:48, [[FM]]:28-
|purpose=<sup></sup>
* [[Speedsolving]]
* [[Fewest Moves]]
}}

'''Roux''' (French pronunciation: [ʁu]) is a [[Rubik's cube]] speedsolving method invented by [[Gilles Roux]]. Unlike the [[CFOP method|CFOP]] and [[Petrus method|Petrus
]] methods, the inventor of this method has used it to achieve an official sub-15 [[average]]. Similarities can be drawn to the Petrus method's block building and the [[Waterman method]]'s layer-on-the-left and edges-last aspects.

==Steps==

1. Build a 1x2x3 block anywhere on the cube.

2. Build a second 1x2x3 block opposite of the first 1x2x3 block, without disrupting the first 1x2x3 block. After this step, there should be two 1x2x3 blocks: one on the lower left side, and one lower right side, leaving the U slice and M slice free to move.

3. Simultaneously [[orient]] and [[permute]] the remaining 4 corners on the top layer (U-slice). You can use [[CMLL]],[[COLL]], or Corner OLL's (along with the T and Y permutation) to do this.

4a. [[Orient]] the 6 remaining edges using only M and U moves (UF, UB, UL, UR, DF, DB need to be oriented correctly).

4b. Solve the UL and UR edges, preserving edge orientation. After this step, both the left and right side layers should be complete.

4c. Solve the centers and edges in the M slice, ''see [[Last Six Edges]]''.

: ''See also: [[L5E]]''

==Pros==

*Like the Petrus method, the Roux method uses fewer moves than the popular Fridrich method.
*It is also more intuitive and requires fewer algorithms.
*After the first block is built the rest of the cube can be solved mostly with R, r, M and U moves thus eliminating rotations.
*CMLL is one of the best algorithm sets as there are only 42 cases and most algorithms are fast OLLCPs from CFOP
*The blockbuilding and intuitive nature of the method allows for rapid improvements in lookahead and inspection
*The LSE step of Roux is very easy to master, as it has easy lookahead and allows for fast, 2-gen MU TPS.

==Cons==

*Block building can be difficult for a beginner to get used to. The reliance on r and M moves may also be difficult for some people, so much so that cubers who have trouble with M turns should probably not use this as their main method (or better, practice the M moves). Slice turns can also be slower than [[OBTM|outer turns]].
*Since the M-slice is used often, especially in the final stages, there is a larger chance of a [[DNF]] rather than a [[+2]] if the solver misses the second flick in an M2, or if the solver misses the last M move. It is a DNF because M uses both the R and L face in one.
*The M-slice becomes increasingly difficult with higher [[order]] puzzles. With [[7x7x7]] and [[6x6x6]], many argue that Roux is essentially unusable; however, with practice, one may be able to do well with it on [[big cubes]].
*The M-slice is very difficult with [[OH]], and OH Roux solvers almost always need to utilize [[table abuse]] and therefore can pretty much never solve one-handed away from a table or other surface. However, if one practices doing one-handed M-slices, it can be done very well but only with a table (which shouldn't be a concern in competitions).

==Improvement==

Free/non-linear blocks: The first block and second block do not need to be built in that order. You can build part of one and finish the other later. This is very useful when there are a lot of free, pre-built blocks and pairs.

Non-matching centres: The first two blocks can be built around incorrect centres. This allows for more efficiency and allows rouxers to take advantage of pre-built blocks. The centres are corrected directly before CMLL with either u M' u' or u' M' u.

Some Roux users have learned multiple algorithms for each CLL case, each affecting edges in a different way. This allows for manipulation of edge orientation, leading to an easier LSE. This is called CMLLEO.

Possibly another improvement is to expand to solving any of the four second blocks. This means that the D-layer colors of the two blocks don't have to match. This is called non-matching blocks. One negative, if someone has already learned a recognition method for CLL, is that to easily use the full range of second block options, a switch to [[NMCLL]] recognition is necessary. Another is that LSE EO is a bit more difficult to recognize in some solves.

Pinkie Pie: a variant proposed by Alex Lau in 2016, it involves orienting the UL/UR edges on the D layer while using an OLLCP algorithm to orient the remaining edges and solving the remaining corners. The user then will get a 4a skip and a very easy 4b step. While this may seem good, many faster Rouxers are of the opinion that it is simply better to influence the EO step and not go to all the hassle of placing UL/UR on D and having to recognise an OLLCP. There is also the reason that many Roux solvers use the method to have less algorithms and do not want to learn the huge OLLCP algset.

EOLR: a variant proposed by Gilles Roux and further documented by Alex Lau, Kian Mansour, and Iuri Grangeiro. It combines steps 4A and 4B of the method, orienting edges and placing ULUR on the D layer simultaneously. The cases are all intuitive, as they involve performing the EO case from different angles to set up a "good arrow" where ULUR can then be placed on bottom.

UFUB: Instead of solving ULUR edges in 4B, UFUB are solved. This can lead to more efficient solutions, but lookahead becomes much more difficult. It is most useful for skipping the "dots" 4C case.

Misoriented centres: Standard roux involves orienting all 6 edges relative to the centre colour that is on the bottom of the blocks. Instead, we can orient them relative to the front colour. As with UFUB, efficiency is improved, but lookahead is hindered. This is most useful for known EOLR cases.

== Notable users ==
* [[Gilles Roux]] [http://www.worldcubeassociation.org/results/p.php?i=2004ROUX01]
* [[Thom Barlow]] (Kirjava) [http://www.worldcubeassociation.org/results/p.php?i=2006BARL01]
* [[Austin Moore]] (BigGreen) [http://www.worldcubeassociation.org/results/p.php?i=2009MOOR01]
* [[Jules Manalang]] (Waffo) [http://www.worldcubeassociation.org/results/p.php?i=2008MANA02]
* [[Alexander Lau]] (5BLD) [http://www.worldcubeassociation.org/results/p.php?i=2011LAUA01]
* [[Kaijun Lin]] (林恺俊) [https://www.worldcubeassociation.org/results/p.php?i=2013LINK01]
* [[Mitsuki Gunji]]
* [[Artur Kristof]] (Arcio) [http://www.worldcubeassociation.org/results/p.php?i=2012KRIS12]
* [[Kian Mansour]] [https://www.worldcubeassociation.org/results/p.php?i=2015MANS03]
* [[Kavin Tangtartharakul]] (GuRoux) [https://www.worldcubeassociation.org/results/p.php?i=2014TANG03]
* [[Vincent Wong]] (Kangaroux) [https://www.worldcubeassociation.org/results/p.php?i=2014WONG08]

==Forum links==
* [https://www.speedsolving.com/forum/showthread.php?3842-Roux-Help-and-Discussion-thread.html Roux help and discussion thread]
* [https://www.speedsolving.com/forum/showthread.php?51553-One-Answer-3x3-Roux-Question.html One-question answer thread]
* [https://www.speedsolving.com/forum/showthread.php?50819-How-to-read-a-Roux-corners-table.html Reading Roux corners tables]
* [https://www.speedsolving.com/forum/showthread.php?47572-Video-Roux-as-a-Beginner-Method.html Beginner's Roux video tutorial]
* [https://www.speedsolving.com/forum/showthread.php?48028-The-Roux-quot-Example-Solve-quot-Game!.html Roux Example solves]
* [https://www.speedsolving.com/forum/showthread.php?35350-Roux-4b-to-4c-Transition.html Roux step 4b-4c transition help]

== External links ==
* [http://grrroux.free.fr/method/Intro.html Gilles Roux's tutorial]
* [https://sites.google.com/view/kianroux Kian's Roux Guide]
* [https://www.youtube.com/channel/UCdEm9-DsuOzNoWmTAYNLRoQ Kian's Youtube Channel]
* [http://wafflelikescubes.webs.com/ Waffle's Roux Site]
* Wikia: [http://rubiks.wikia.com/wiki/Roux_Method Roux Method]
* [http://www.speedsolving.com/forum/showthread.php?t=11506 Waffle's Roux Tutorial]
* [http://rouxtorial.webs.com/ 5BLD's and PandaCuber's Roux Tutorial]
* [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=634675&viewfull=1#post634675 Reconstruction for BigGreen's unofficial Ao5 9.51]
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/5923 Original Method Proposal]

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

Zagorec method

2017-04-21T17:12:10Z

Runnerboy1008: Just found a spelling error

{{Method Infobox
|name=Zagorec
|image=Zagorec_method.gif
|proposers=[[Damjan Zagorec]]
|year=2012
|anames
|algs=5
|variants
|steps=8
|moves=70+
|purpose=<sup></sup>

}}
The Zagorec method is a 3x3 method created by [[Damjan Zagorec]] in 2012..

== The Steps ==
The following steps describe an approach suited for beginners, more advanced users might combine steps 4 and 5 and for 7 and 8 steps use a [[Fridrich]] type last layer and do [[PLL]].

1. Orient edges

2. Build up and down cross (Permute U and D edges)

3. Orient corners

4. Put middle layer edges in the right place (Solve E-Slice)

5. Build proper down cross (Fix D Edges)

6. Put corners with down color in right place (Solve D Corners)

7. Permute up corners ([[CPLL]])

8. Permute up edges ([[EPLL]])

==How to hold the cube==

How to hold the cube (for easier understanding of examples):

White center on down face

Yellow center on up face

Blue center on front face

Green center on back face

Red center on the right face

Orange center on the left face

==Orient edges==

=== [[EO]] Detection ===
Looking at the edges on the U face, D face, F face of the E-slice, and B face of the E-slice:
* If the sticker has L/R color it's a bad edge.
* If the sticker has F/B color, look at the sticker on the other side of the edge.
: * If the side sticker has U/D color, it's a bad edge.

=== Orienting 2 Bad Edges ===
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.

=== Orienting 4 + Bad Edges ===
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.

=== Orienting 6 Bad Edges ===
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.

We need cube with all 12 good edges.

If we have 4 good edges on the F face, with F or F' turn we will transform 4 good edges into 4 bad edges and the other way around.

How to turn a bad edge into a good edge:

Case 1:

If we have 2 bad edges then we have to put one bad edge in front face, perform F turn and now we have 1 good edge and 3 bad edges on the front face. Now put the other bad edge on the place of that one good edge in the F face and perform another F turn. Now we have 0 bad edges.

Case 2:

If we have 4 bad edges, we have to put all bad edges into front face but without F, F' and B, B' turns and then make F or F' turn.

Case 3:

If we have 6 bad edges then we do Case 2 one time and Case 1 one time.

Case 4:

If we have 8 bad edges then we do Case 2 two times.

Case 5:

If we have 10 bad edges then we do Case 2 two times and Case 1 one time.

Case 6:

If we have 12 bad edges then we do turn F and B and Case 1 one time.

==Build up and down cross==

This step is done intuitively.

Now build cross on up and down face with up and down colors. You can put edges with down or up color (white or yellow) on up or down face. It doesn't matter if you put down color on up face or up color on down face.

==Orient corners==

In this step you have to orient all corners. You can have down layer corners on top layer and up layer corners on bottom layer. Only important thing in this step is that corners are oriented properly.
For this you will use just one algorithm.

R’ D L2 D’ R

Place incorrectly oriented corners in UFL (up-front-left) position with up or down face color sticker on left side and second corner on DFR (down-front-right) position with up or down face color sticker on front side. Now perform algorithm.
For placing corners on UFL and DFR position you can use only U, D, R2 and L2 moves and you must not rotate the cube.
When you are left with 3 unoriented corners you will not be in position to orient 2 corners in same time. In case like that you need to perform algorithm and it will orient just one. Now you have 2 unoriented corners and you need to perform algorithm just once more.

After finishing this step cube will have on up and down face just up and down color stickers mixed up, middle layer will have in front and back face just front and back colors stickers mixed up and on left and right side Left and right color stickers mixed up.

==Put middle layer edges on right place==

This step is done intuitively.

Place middle layer edges in right position using just R2, L2, B2 and F2 moves.

After that step you should have in middle layer on front face only front face color (blue), on back face only back face color (green), on left face only left face color (orange) and on right face only right face color (red).

This section can also be done with Roux L4E, but on E instead of M. Bear in mind you can still have an EP parity because the rest of the edges / corners are not solved.

==Build proper down cross==

This step is done intuitively.

Now build down color (white) cross using only R2, U and D face turns. You have to color match down cross edges with centers.

Note: Step 4. and 5. can be performed simultaneously.

==Put corners with down color in right place==

In this step you will need one algorithm: R2 U R2 U’ R2 (puts UFR piece in DFR position)

Through entire step you must not rotate cube, use only U and D moves to position pieces.
Piece that you need to put in DFR position (down-front-right) you must place in UFR (up-front-right) position and then perform the algorithm.
For placing pieces in UFR position use only U move. If there is no more bottom layer pieces in top layer you need to put incorrectly placed piece from bottom layer in top layer using algorithm and then place it back in proper position in bottom layer.

Every time when you perform R2 U R2 U’ R2 algorithm your cube will end up with FR (front-right) edge switched with BR (back-right) edge. Just ignore this. It is only important that you don’t rotate cube trough 6., 7., and 8. step.

At the end of this step your bottom and middle layers are solved or your bottom layer is solved and middle layer has FR (front-right) edge switched with BR (back-right) edge.

==Permute up corners==

In this step you will need one algorithm: R2 U R2 U’ R2 U’ D R2 U’ R2 U R2 (switches UFR and UBR piece). (You can use [[CPLL]] instead.)

You need to put top layer corners on proper positions using only algorithm for switching adjacent corners. For putting corners in desired position you can use only U move.

In the end of this step you will have headlights on each side of top layer.

==Permute up edges==

In this step you will need two algorithms:

1. R2 U2 R2 U2 R2 (switches opposite edges, UF (up-front) and UB (up-back) edge)

2. R2 U R2 U R2 U2 R2 U2 R2 U R2 U’ R2 (switches adjacent edges, UF (up-front) and UR (up-right) edge)

(You can use [[EPLL]] instead.)

You need to put top layer edges on proper positions using only algorithms for switching adjacent edges and switching opposite edges. For putting edges in desired position you can use only U move.

P.S. For permuting corners and edges in top layer you can simply use [[PLL]].

Cube is solved!

== Pros ==

:Just 5 easy algorithms to remember.
:Can be performed very fast.

== Cons ==
:Large Movecount
:Lookahead is limited

==Example solve==

Up face yellow:

Front face blue:

Scramble: L2 B2 U' B2 R2 U' B2 F2 L2 F2 U B L D' U L U' F2 U2 F L'

1. Orient edges : L R' F U F R2 F'

2. Build up and down cross: R' L' U L R D' R' L' D2 L

3. Orient corners: U D' (R' D L2 D' R) U D2 (R' D L2 D' R) U2 D (R' D L2 D' R) U' R2 D' (R' D L2 D' R)

4. Put middle layer edges on right place: R2 L2 F2 B2

5. Build proper down cross: D2 U R2 D' R2 D2 R2 D2 R2

6. Put corners with down color in right place: U D (R2 U R2 U' R2) D2 (R2 U R2 U' R2) D'(R2 U R2 U' R2) D2 (R2 U R2 U' R2) D2 (R2 U R2 U' R2) D

7. Permute up corners: U' (R2 U R2 U’ R2 U’ D R2 U’ R2 U R2) U2 (R2 U R2 U’ R2 U’ D R2 U’ R2 U R2) D2 U'

8. Permute up edges: (R2 U2 R2 U2 R2) U' (R2 U2 R2 U2 R2) U2 (R2 U R2 U R2 U2 R2 U2 R2 U R2 U’ R2) U'

== External links ==

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