Average movecount: 6.0

Average double turns: 1.0

Algorithms: 22

This is an exhaustive list of all possible edge orientation cases (upto AUF) possible after first block, with 4 misoriented edges; given the edge in DB is oriented. The edges marked green in each diagram are oriented, and the edges marked red are misoriented. The general theme is to ensure there is exactly one misoriented edge in DB/DF and setting up to the staircare pattern.

Note that the final two moves are flexible and can be one of (U r), (U' r), (U r') or (U' r'); all these will solve the EO case. The choice has to be made based on which algorithm will result in the easiest BF case, or to preserve some block that can be utilised in the 2-gen part of the solve. As a rule of thumb, the last move should be such that the bottom centre ends up in the top, and the second-to-last move should be such that a BF edge connects with the bottom centre if possible.