From Speedsolving.com Wiki
Revision as of 15:27, 13 June 2020 by RedstoneTim (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
ZZ-EF method
Information about the method
Proposer(s): Matt DiPalma
Proposed: 2014
Alt Names: ZZ-Edges First
Variants: none
No. Steps: unknown
No. Algs: 0-120
Avg Moves: 50

ZZ-EF or ZZ-Edges First is a variant of the ZZ method proposed by Matt DiPalma in 2016. This variant aims to maximize the occurrence of skips and easy cases, increasing the chance of lucky and thus fast solves.


  1. EOLine: Like in ZZ, the solve starts by orienting all edges and creating a line.
  2. Lucky ZZ F2L: The first two layers are solved <RUL(D)>-gen. While all F2L edges (two cross edges and four e-slice edges) and one F2L corner need to be solved correctly, the other three corners only need to form a 3-cycle which can be solved using a commutator, maximizing the chance of easier cases.
  3. Solving edges and one corner: Using Speed-Heise algorithms during last slot, all remaining edges are permuted and at least one corner solved, leaving one 3-cycle on the top and one on the bottom. This may also be done intuitively like in Heise.
  4. Two Commutators: Two commutators are applied to solve the cube. One out of 27 times, only one commutator is required to solve the puzzle.


  • When the remaining edges and one corner are solved using a Heise approach, no memorized algorithms are required.
  • Due to the higher chance of lucky solves, faster singles are more common than in other methods.


  • Unless algorithms are memorized for the 3-cycles, one has to come up with them quickly and perform a rotation to solve the 3-cycle on the bottom.
  • During a speedsolve, it may be hard to quickly solve the corners in such a way that they form a 3-cycle because of recognition and more thinking required.

See also

External links