Difference between revisions of "Russo method"
From Speedsolving.com Wiki
m |
m |
||
Line 23: | Line 23: | ||
3b. Solve the last 5 edges is one algorithm. | 3b. Solve the last 5 edges is one algorithm. | ||
+ | |||
+ | ==Pros== | ||
+ | *Like the Roux and Petrus methods, it is a blockbuilding method, has a lower move count than the [[CFOP]] method. | ||
+ | *CLLs are the fast OLLCPs from CFOP | ||
+ | |||
+ | ==Cons== | ||
+ | *Blockbuilding can be hard for a beginner to understand | ||
+ | *If a M move is left out, it could result in a DNF | ||
+ | *Depending on how blockbuilding is done, and the final step, M-slices are used a lot, which makes it harder for higher layer puzzles and OH solving. | ||
==Possible Improvements== | ==Possible Improvements== |
Revision as of 00:07, 18 June 2019
|
Russo is a method proposed by Anthony Russo in 2019. Russo is similar to Roux in the fact it is a blockbuilding method, but not similar in the way it solves BD edge, resulting in the final step only solving the last 5 edges instead of the last six.
Steps
1. Build the First 2 Layers without the FD cross edge.
2. Orient and Permute the Last Layer corners.
3a. Orient the remaining 5 edges. This step is done intuitively.
3b. Solve the last 5 edges is one algorithm.
Pros
- Like the Roux and Petrus methods, it is a blockbuilding method, has a lower move count than the CFOP method.
- CLLs are the fast OLLCPs from CFOP
Cons
- Blockbuilding can be hard for a beginner to understand
- If a M move is left out, it could result in a DNF
- Depending on how blockbuilding is done, and the final step, M-slices are used a lot, which makes it harder for higher layer puzzles and OH solving.
Possible Improvements
- Arrow - Instead of blockbuilding the first 2 layers, solve an arrow on the bottom layer without the DF edge, then do F2L. This could increase TPS and better lookahead