Difference between revisions of "LEOR"

From Speedsolving.com Wiki
m (Added links to 1x2x3 Block)
Line 2: Line 2:
 
|name=LEOR
 
|name=LEOR
 
|image=Leor.gif
 
|image=Leor.gif
|proposers= Arc, Pyjam
+
|proposers= [[Noah Arthurs]], Arc, Pyjam
 
|year=2017
 
|year=2017
 
|anames= LEOR-a
 
|anames= LEOR-a
Line 70: Line 70:
  
 
Due to how similar [[ZZ]] and LEOR are, most [[ZZ method#Variants|variants of ZZ]] can also be applied to LEOR.
 
Due to how similar [[ZZ]] and LEOR are, most [[ZZ method#Variants|variants of ZZ]] can also be applied to LEOR.
 +
 +
==History==
 +
 +
In 2013 Noah Arthurs proposed Noah's CP Block 2.0[[https://www.speedsolving.com/threads/noahs-cp-block-method-2-0.41986/]], a corner permutation first method which was eventually grouped into the [[CEOR]] method. Within the thread for Noah's CP Block 2.0, Noah also proposed a version of the method which doesn't solve corner permutation early in the solve. This gives it the same steps as LEOR. His post about this separate method wasn't widely noticed by the puzzle community at the time. Two years later, [[Joseph Briggs]] proposed the Briggs method, another method which was moved under the CEOR name. Soon after, the LEOR method was independently created by both Arc and Pyjam. Arc created the method by removing the corner permutation aspect from the Briggs method.[https://www.speedsolving.com/threads/roux-breaker-the-yruru-method.77201/post-1367918] It is currently unknown how Pyjam developed LEOR.
  
 
== See also ==
 
== See also ==

Revision as of 15:45, 25 December 2021

LEOR method
Leor.gif
Information about the method
Proposer(s): Noah Arthurs, Arc, Pyjam
Proposed: 2017
Alt Names: LEOR-a
Variants: LEOR-b, EOMR
No. Steps: 4
No. Algs: 4-497
Avg Moves: 48 with ZBLL
Purpose(s):


LEOR (Left block, EOStripe, Right block) is a method which could be seen as a mix between ZZ and Roux, although due to effectively solving an EO223 in the beginning, it also shares similarities with Petrus.

LEOR allows for ergonomic steps while also offering a low movecount.

Steps

  1. FB/LB: Build a 1x2x3 Block on the left side of the cube.
  2. EOStripe: Orient all edges while simultaneously solving DF and DB.
  3. SB/RB: Build a second 1x2x3 block on the right side of the cube.
  4. ZBLL: Finish the last layer in one step using one of 493 algorithms.

Pros

  • Ergonomic movesets after FB, especially for OH.
  • Low movecount - similar to that of Roux.
  • No rotations required.

Cons

  • Steep learning curve - planning both FB and EO is very difficult.
  • Difficult to smoothly and efficiently solve EO and the DFDB edges at the same time.

Advanced Techniques

  • Corner control: it is easy to control the OCLL of the last layer which can be used to force easier ZBLL subsets.

Big Cubes

  1. L and R centers
  2. 1x3x4 block on L (like in Meyer)
  3. Last 4 Centers
  4. Place the block on D, with the unsolved 1x1x4 in DF, then pair up any edge and place it in DF
  5. Pair up the last 8 edges (the fastest way is probably with 3-2-3 edge pairing)
  6. EOStripe + parity
  7. Right block
  8. COLL
  9. EPLL + parity

nb. If you're solving odd layered cubes, use ZBLL instead of COLL then EPLL + parity.

Variants

LEOR-b

  1. Solve a 2x2x2 in DBL
  2. Solve the FL pair
  3. EODF (EOStripe but only with the DF edge)
  4. Right block
  5. ZBLL


EOMR

  1. FBEO
  2. Stripe while preserving EO
  3. Right block
  4. ZBLL

Due to how similar ZZ and LEOR are, most variants of ZZ can also be applied to LEOR.

History

In 2013 Noah Arthurs proposed Noah's CP Block 2.0[[1]], a corner permutation first method which was eventually grouped into the CEOR method. Within the thread for Noah's CP Block 2.0, Noah also proposed a version of the method which doesn't solve corner permutation early in the solve. This gives it the same steps as LEOR. His post about this separate method wasn't widely noticed by the puzzle community at the time. Two years later, Joseph Briggs proposed the Briggs method, another method which was moved under the CEOR name. Soon after, the LEOR method was independently created by both Arc and Pyjam. Arc created the method by removing the corner permutation aspect from the Briggs method.[2] It is currently unknown how Pyjam developed LEOR.

See also

External links