Difference between revisions of "CR†"
(The article wasn't written in an encyclopedic style. I think this is cleaner this way. I hope I did not any mistake.) 

Line 1:  Line 1:  
{{Substep Infobox  {{Substep Infobox  
−  name=  +  name=CR+ 
−  image=  +  image= 
proposers=[[Matt DiPalma]]  proposers=[[Matt DiPalma]]  
−  variants=  +  variants=CR, Step 34 of [[Heise Method]] 
−  +  anames=  
year=2017  year=2017  
subgroup=  subgroup=  
−  algs=144 (72 with mirrors)  +  algs=144 (72 with mirrors) for CR2+ substep 
−  moves=26.135 for  +  moves=26.135 (for CR1, CR2+ and CR3+ substep) 
purpose=<sup></sup>  purpose=<sup></sup>  
* [[Speedsolving]], [[FMC]]  * [[Speedsolving]], [[FMC]]  
previous=[[F2L1 + EO cube state]]  previous=[[F2L1 + EO cube state]]  
−  next=[[  +  next=[[Solved cube state]] 
}}  }}  
−  '''  +  '''CR+''' is a revised, simplified and improved version of [[Cardan Reduction]]. Recognition is easier with CR+ than [[Cardan ReductionCR]] and the last substep is [[L3C]], easier than CR3 substep. 
−  
−  
+  == Steps ==  
+  # ''(CR1)'' [[F2L1 + EO cube state]] to [[F2L1C + EO + 2x1x1 block cube state]] : Insert FR edge and create a Ulayer 2x1x1 block.  
+  # ''(CR2+)'' [[F2L1 + 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 [https://docs.google.com/spreadsheets/d/1n9CFDrC2geg6W1an8ZPFVyUwoONbgUIEwnRpKbrs0 here].  
+  # ''(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/1n9CFDrC2geg6W1an8ZPFVyUwoONbgUIEwnRpKbrs0  +  * [https://docs.google.com/spreadsheets/d/1n9CFDrC2geg6W1an8ZPFVyUwoONbgUIEwnRpKbrs0 CR2+ Alg Spreadsheet] 
+  * [https://www.speedsolving.com/forum/threads/cardanreductionnovellsllapproach.64042 Forum post]  
[[Category:3x3x3 last slot substeps]]  [[Category:3x3x3 last slot substeps]] 
Revision as of 22:55, 5 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) F2L1 + EO cube state to F2L1C + EO + 2x1x1 block cube state : Insert FR edge and create a Ulayer 2x1x1 block.
 (CR2+) F2L1 + 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.