cuberarun
Member
this method is basically improvised R2 and it uses the same idea.
buffer:ULB
helper:URF
idea is to insert the target at URF and do U2 and undo the insertion.therefore in the form of ABA'.\
note:when executing U2 UBR and UFL gets switched.
Setup list
Normal cases
DFR –R’F’R2FRU2R’F’R2FR
DRB-D’ R’F’R2FRU2R’F’R2FRD
DBL-D2 R’F’R2FRU2R’F’R2FRD2
DLF-D R’F’R2FRU2R’F’R2FRD’
FRD-FDF’U2FD’F’
RBD-D2R’DRU2R’D’R
BLD-R’D2RU2R’D2R
LFD-R’DRU2R’D’R
FDL-DR’D’RU2R’DRD’
RDF-R’D’RU2R’DR
BDR-FD’F’U2FDF’
LDB-FD2U2 FD2
Special cases
URF-U2
RFU-R’D2R FD2U2R’D2R FD2
FUR- FD2R’D2RU2 R’D2R FD2
UBR-LW’UR’D2RU’R’R2X’U2
UFL-U2XR2D2RUR’D2RU’LW
RUB-X ZFR’U’RD2R’URD2F’R2Z’
• LUF- FU2R’D’RU2R’DRF’U2
BRU-R’Y’U2RDR’U2RD’R’YRU2
FLU-L’YRDR’U2RD’R’U2Y’LU2
Parity
Edges first
Memo: memorize corners if you find parity during edge memorization treat UB and UL or BU and LU swapped.
Execution : execute every target with U2 and final target with OP.
Corners first
Memo: edges if you find parity during corner memorization treat DFR and DLF corners swapped.
Execution: after complete execution perform this algorithm
M2 YL2R’UR’U’R’FR2U’R’U’RUR’F’L2 which is basically M2 YL2 T-perm L2
buffer:ULB
helper:URF
idea is to insert the target at URF and do U2 and undo the insertion.therefore in the form of ABA'.\
note:when executing U2 UBR and UFL gets switched.
Setup list
Normal cases
DFR –R’F’R2FRU2R’F’R2FR
DRB-D’ R’F’R2FRU2R’F’R2FRD
DBL-D2 R’F’R2FRU2R’F’R2FRD2
DLF-D R’F’R2FRU2R’F’R2FRD’
FRD-FDF’U2FD’F’
RBD-D2R’DRU2R’D’R
BLD-R’D2RU2R’D2R
LFD-R’DRU2R’D’R
FDL-DR’D’RU2R’DRD’
RDF-R’D’RU2R’DR
BDR-FD’F’U2FDF’
LDB-FD2U2 FD2
Special cases
URF-U2
RFU-R’D2R FD2U2R’D2R FD2
FUR- FD2R’D2RU2 R’D2R FD2
UBR-LW’UR’D2RU’R’R2X’U2
UFL-U2XR2D2RUR’D2RU’LW
RUB-X ZFR’U’RD2R’URD2F’R2Z’
• LUF- FU2R’D’RU2R’DRF’U2
BRU-R’Y’U2RDR’U2RD’R’YRU2
FLU-L’YRDR’U2RD’R’U2Y’LU2
Parity
Edges first
Memo: memorize corners if you find parity during edge memorization treat UB and UL or BU and LU swapped.
Execution : execute every target with U2 and final target with OP.
Corners first
Memo: edges if you find parity during corner memorization treat DFR and DLF corners swapped.
Execution: after complete execution perform this algorithm
M2 YL2R’UR’U’R’FR2U’R’U’RUR’F’L2 which is basically M2 YL2 T-perm L2