Difference between revisions of "CR†"
From Speedsolving.com Wiki
(The article wasn't written in an encyclopedic style. I think this is cleaner this way. I hope I did not any mistake.) |
(corrected from + to † because this is a Christian method) |
||
Line 1: | Line 1: | ||
{{Substep Infobox | {{Substep Infobox | ||
− | |name= | + | |name=CR† |
|image= | |image= | ||
|proposers=[[Matt DiPalma]] | |proposers=[[Matt DiPalma]] | ||
Line 7: | Line 7: | ||
|year=2017 | |year=2017 | ||
|subgroup= | |subgroup= | ||
− | |algs=144 (72 with mirrors) for | + | |algs=144 (72 with mirrors) for CR2† substep |
− | |moves=26.135 (for CR1, | + | |moves=26.135 (for CR1, CR2† and L3C substep) |
|purpose=<sup></sup> | |purpose=<sup></sup> | ||
* [[Speedsolving]], [[FMC]] | * [[Speedsolving]], [[FMC]] | ||
Line 15: | Line 15: | ||
}} | }} | ||
− | '''CR+''' is a revised, simplified and improved version of [[Cardan Reduction]]. Recognition is easier with | + | '''CR+''' is a revised, simplified and improved version of [[Cardan Reduction]]. Recognition is easier with CR† than [[Cardan Reduction|CR]] and the last substep is [[L3C]], easier than CR3 substep. |
== Steps == | == Steps == | ||
# ''(CR1)'' [[F2L-1 + EO cube state]] to [[F2L-1C + EO + 2x1x1 block cube state]] : Insert FR edge and create a U-layer 2x1x1 block. | # ''(CR1)'' [[F2L-1 + EO cube state]] to [[F2L-1C + EO + 2x1x1 block cube state]] : Insert FR edge and create a U-layer 2x1x1 block. | ||
− | # ''( | + | # ''(CR2†)'' [[F2L-1 + EO cube state]] to [[L3C cube state]] : Solve the 2x1x1 pair, all edges, and last D corners. |
− | #* Algorithms for the 2nd substep ( | + | #* Algorithms for the 2nd substep (CR2†) can be found [https://docs.google.com/spreadsheets/d/1n9C-FDrC2geg-6W1an8ZPFVyUwoONbgUIEwnRpKbrs0 here]. |
# ''(L3C)'' [[L3C cube state]] to [[Solved cube state]] Solve the remaining 3 corners using [[L3C]] algs. | # ''(L3C)'' [[L3C cube state]] to [[Solved cube state]] Solve the remaining 3 corners using [[L3C]] algs. | ||
== External links == | == External links == | ||
− | * [https://docs.google.com/spreadsheets/d/1n9C-FDrC2geg-6W1an8ZPFVyUwoONbgUIEwnRpKbrs0 | + | * [https://docs.google.com/spreadsheets/d/1n9C-FDrC2geg-6W1an8ZPFVyUwoONbgUIEwnRpKbrs0 CR2† Alg Spreadsheet] |
* [https://www.speedsolving.com/forum/threads/cardan-reduction-novel-ls-ll-approach.64042 Forum post] | * [https://www.speedsolving.com/forum/threads/cardan-reduction-novel-ls-ll-approach.64042 Forum post] | ||
[[Category:3x3x3 last slot substeps]] | [[Category:3x3x3 last slot substeps]] |
Revision as of 19:04, 6 November 2017
|
CR+ is a revised, simplified and improved version of Cardan Reduction. Recognition is easier with CR† than CR and the last substep is L3C, easier than CR3 substep.
Steps
- (CR1) F2L-1 + EO cube state to F2L-1C + EO + 2x1x1 block cube state : Insert FR edge and create a U-layer 2x1x1 block.
- (CR2†) F2L-1 + EO cube state to L3C cube state : Solve the 2x1x1 pair, all edges, and last D corners.
- Algorithms for the 2nd substep (CR2†) can be found here.
- (L3C) L3C cube state to Solved cube state Solve the remaining 3 corners using L3C algs.