Difference between revisions of "CR†"

(Undo revision 33433 by Martinss (talk) it's its own method. there are algs genned. would you redirect CMLL to COLL? NO! Leave britney alone)
(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=''[redacted]''
+
|name=CR+
|image=CRp.PNG
+
|image=
 
|proposers=[[Matt DiPalma]]
 
|proposers=[[Matt DiPalma]]
|variants=none
+
|variants=CR, Step 3-4 of [[Heise Method]]
|anames=Step 3-4 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 LS/LL
+
|moves=26.135 (for CR1, CR2+ and CR3+ substep)
 
|purpose=<sup></sup>
 
|purpose=<sup></sup>
 
* [[Speedsolving]], [[FMC]]
 
* [[Speedsolving]], [[FMC]]
 
|previous=[[F2L-1 + EO cube state]]
 
|previous=[[F2L-1 + EO cube state]]
|next=[[Solved_cube_state]]
+
|next=[[Solved cube state]]
 
}}
 
}}
  
'''CR†''' is a revised, ''[redacted]''-oriented version of [[Cardan Reduction]] that features improved ''[redacted]'' and simplified ''[redacted]''. Further details pertaining to this approach are currently registered (TS) classified, pending declassification to security-cleared US citizens after November 19, 2026.
+
'''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.
 
 
Despite the extremely high level of secrecy surrounding every aspect of this edge-oriented LS/LL variant, the full CR2† algorithm set is published in the External Links. However, it is compiled in some strange alien lexicon.
 
  
 +
== 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 [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.
  
 
== External links ==
 
== External links ==
* [https://docs.google.com/spreadsheets/d/1n9C-FDrC2geg-6W1an8ZPFVyUwoONbgUIEwnRpKbrs0/edit?usp=sharing CR2† Alg Spreadsheet]
+
* [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]
  
 
[[Category:3x3x3 last slot substeps]]
 
[[Category:3x3x3 last slot substeps]]

Revision as of 22:55, 5 November 2017

CR+
[[Image:]]
Information
Proposer(s): Matt DiPalma
Proposed: 2017
Alt Names:
Variants: CR, Step 3-4 of Heise Method
Subgroup:
No. Algs: 144 (72 with mirrors) for CR2+ substep
Avg Moves: 26.135 (for CR1, CR2+ and CR3+ substep)
Purpose(s):
Previous state: F2L-1 + EO cube state
Next state: Solved cube state

F2L-1 + EO cube state -> CR+ step -> Solved cube state


The CR+ step is the step between the F2L-1 + EO cube state and the Solved cube state.

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

  1. (CR1) F2L-1 + EO cube state to F2L-1C + EO + 2x1x1 block cube state : Insert FR edge and create a U-layer 2x1x1 block.
  2. (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.
  3. (L3C) L3C cube state to Solved cube state Solve the remaining 3 corners using L3C algs.

External links