3x3 ROUX TUTORIAL
All that remains is to solve the last six edges (LSE). We can generally do this turning only the M slice and the U slice, which helps our speed considerably. A common approach is for the left fingers to control U - primarily the index finger but also the middle finger for U2 turns - while the right fingers control M - primarily the ring finger for M', the middle finger for M, and both for M2.
In this step, we will orient the last six edges (the 4 on top plus the bottom 2 between the blocks).
Taking Inventory
First, turn the M slice so that the white or yellow center is facing up. Only then can we easily see if an edge is oriented (good) or disoriented (bad).
Second, count the bad edges:
- An edge is oriented correctly if its yellow or white sticker is on the top or bottom of the cube. Otherwise, it is a bad edge that needs to be flipped. In other words, when all the edges are oriented, the top and the bottom of the cube will have only yellow or white stickers. Edges are always flipped in pairs, so there will be 0, 2, 4, or 6 bad edges.
- Don't look at the DB edge. Five of the six edges are immediately visible, so the state of the hidden DB edge can be inferred without rotating the cube to look at it. If there is an odd number of bad edges visible, DB is also bad. If there is an even number of bad edges visible, DB is good.
Arrows and the Burden of Freedom
Orienting the edges is a flexible process. If you like, you can simply memorize the 11 cases and some algorithms that will solve them (chart below), and move on. However, if you understand how these algorithms work, it will help you solve the LSE more efficiently later on.
The case that is easiest to solve is an Arrow case: 3 bad edges on the top and 1 bad edge on the bottom. It is solved in just three moves.
Front Arrow
(M'U'M')
Back Arrow
(MU'M')
When you get an Arrow, the bad bottom edge can be on the front or the back. In either case, you turn the U slice so that the top "arrow" points to the bad bottom edge, bring the bad bottom edge up with M or M', then orient all edges with any U turn move followed by any M turn.
- A Front Arrow can be solved (M'U'M') or (M'UM') or a similar sequence that begins with M'.
- A Back Arrow can be solved with (MU'M') or a similar sequence that begins with M.
Arrow Example
In our earlier example, we have a Back Arrow case which can be solved (U2 MU'M'). The result is shown below.
(U2 MU'M')
Our five visible edges are all good, so we know the DB edge is also good. This completes edge orientation.
Other Cases
We solve the other cases by cycling through the various cases until we get an Arrow case. We use two algorithmic tools to do this:
- (M'UM') flips the orientation of the UL, UF, UR, and DF edges
- (M'U2M) switches the position of the UF and DF edges
Edge Orientation Cases
After counting the bad edges, turn the U layer until your edges match one of the 11 cases below. The purple edges are bad.
Cradle
- M'U2M' cycles to Back Arrow
- Algorithm: (MU2)(M'U2)(M'U'M')
Cross
- M'U2M' cycles to Front Arrow
- Algorithm: (M'U2)(M'U2)(M'U'M')
Stinger
- M2 cycles to Front Arrow
- Algorithm: (M2U')(M'U'M')
Neighbors
- M'UM' cycles to Front Arrow
- Algorithm: (M'UM') U2 (M'U'M')
Alt: U (M'U'M') U2 (M'U'M')
Front Diagonal
- MU'M cycles to Front Arrow
- Algorithm: (M'U'M) U' (M'U'M')
Back Diagonal
- M'UM' cycles to Back Arrow
- Algorithm: (M'U'M') U' (MU'M')
Top Pair
- M'UM' cycles to Stinger
- Algorithm: (M'UM) U' (M'U'M')
Alt: (RUR'U') M' (URU'r')
Bottom Pair
- M'UM' cycles to Back Arrow
- Algorithm: (M'UM') U' (MU'M')
Alt: (M'U'M') U (MU'M')
All Bad
- M'UM' cycles to Front Diagonal
- Algorithm: (M'U'M') U2 (M'U'M) U' (M'U'M')
Alt: (RU'r'U') M' (UrUr')
Front Arrow
- M'UM' solves
- Algorithm: (M'U'M')
Back Arrow
- MU'M' solves
- Algorithm: (MU'M')
Edge orientation is complete when the top and bottom of the cube have only yellow or white stickers. You are then ready to start permuting the last six edges, starting with UL and UR.
Back