The Gilles Roux
method
Further help to the right block 
The following tables may provide some help to build
the second block. They enlist factual blockbuilding cases.
They are really not meant to be mugged up (in time it
becomes automatic to solve any cases), since they are fast, at the same time
they are not always optimal!
On the other hand they are good to find easier
solution for some more difficult cases.
Not all cases are listed here: there are many trivial
and mirrored cases.
The 1x2x2
It is not too difficult to solve the first corner-edge
pair, just find the fewest possible algorithms made of M, U, R, r moves. If you
can’t manage the 1x2x2 the way described in the previous section, take a look
at the following table. Bring corner-edge pair to one of the following cases,
and look for the missing edge needed for the 1x2x2.
Many times it doesn’t matter if it’s r or R,
respectively r or M’. Choose the one that may be good for later. Pictures on
the left an right are equivalent.
Missing edge:
YellowGreen
YellowRed
|
Place of missing
edge: |
Algorithm: |
RU
|
r2U'RU2 |
RF
|
r2U'R2U2 |
|
RB |
r2U |
|
RD |
rUR'U'rU |
|
DB |
r'Ur'U |
|
UR |
U'r'U'r'U |
|
FR |
RU'r2UrU' |
|
BR |
r'U'r'U'R'U2 |
|
DR |
r2UM'UR'U' |
|
BD |
r2U'R'U2 |
Missing edge: YellowRed
YellowBlue
|
Place of missing
edge: |
Algorithm: |
RU
|
rU' |
RF
|
r2U'RUr'U' |
|
RB |
rUR'U2 |
|
RD |
rUR2U2 |
|
DB |
MUM'rU' |
|
UR |
UrURU2 |
|
FR |
rUrURU |
|
BR |
r'UrUrU' |
|
DR |
R2UrU'R'U2 |
|
BD |
rU'M'U'RU |
Missing edge: YellowRed
YellowBlue
|
Place of missing
edge: |
Algorithm: |
RD
|
U2r'U' |
LU
|
U2r'UR2U2 |
|
UB |
UR'F'U'F |
|
DF |
rU2R'URU2 |
|
DB |
U2r'URU2 |
|
DR |
URF'U'F |
|
UL |
r'U'r2Ur'U |
|
BU |
UR2Ur'U' |
|
FD |
U2r2UrU' |
|
BD |
U2r2U'rU' |
Missing edge: YellowGreen
YellowRed
|
Place of missing
edge: |
Algorithm: |
RD
|
RU' |
LU
|
U'R'U'RUR2U' |
|
UB |
U2rUr'U |
|
DF |
U'RUM'U' |
|
DB |
U'MUR'U' |
|
DR |
R2U'rUM2U' |
|
UL |
U'M'UR'U' |
|
BU |
UR'U2 |
|
FD |
U'M2UR'U' |
|
BD |
U'rUM'U' |
The last corner-edge
pair
Here we
only study 6 cases: 2 states and 3 orientations. All states would be 14 row in
each table, but many of them are transformable to each other with M and U, so
it’s enough to enlist less.
Missing edge: YellowBlue
|
Place of missing
edge: |
Algorithm: |
RU
|
U'RU'R'URUR' |
UR
|
UMU'M'rUR' |
|
LU |
U'RUR'URUR' |
|
UL |
U'MUM'rUR' |
|
BU |
RUR' |
|
UB |
rU2M2U'R' |
|
RF |
RUMUM'U'R' |
|
FR |
RUMU'M2UR' |
Missing edge: YellowBlue
|
Place of missing
edge: |
Algorithm: |
RU
|
URU'R' |
UR
|
U'M'U2M'rU'R' |
|
LU |
U'MU2rU'R' |
|
UL |
F'U'F |
|
BU |
M'U'MU'RU2R' |
|
UB |
M'UM'rU'R' |
|
RF |
U'RU'R'U'RU2R' |
|
FR |
U2RUM'UR' |
Missing edge: YellowBlue
|
Place of missing
edge: |
Algorithm: |
RU
|
RU2R'U'RUR' |
UR
|
UM'URB'RBR2 |
|
LU |
RBU2B'R' |
|
UL |
RU'r'U2rM'UR' |
|
BU |
URUB'RBR2 |
|
UB |
F'L'U2LF |
|
RF |
RUR'U'RUR'U'RUR' |
|
FR |
RU2R'U'rUR' |
Missing edge: YellowBlue
|
Place of missing
edge: |
Algorithm: |
BU
|
rU'MUR' |
UB
|
U'RU'M'UR' |
|
FR |
RUMU2M2UR' |
Missing edge: YellowBlue
|
Place of missing
edge: |
Algorithm: |
BU
|
URU'R'URU'R' |
UB
|
RU'R'UMRU'R' |
|
RF |
RUR'U'RU2R'U'RUR' |
|
FR |
RU'r'MUrU'R' |
Missing edge: YellowBlue
|
Place of missing
edge: |
Algorithm: |
BU
|
URUR'U'RUR' |
UB
|
rU2r'U2rUR' |
|
RF |
RUr'Ur2B'R'BR' |
|
FR |
RUr'U'M'rUR' |
Right block building techniques
CMLL fast recognition technique
Fridrich method vs. Roux method