After this lesson
- Explain the precondition for ZBLL
- Understand the seven case groups
- Decide whether to learn COLL first
The precondition
ZBLL assumes the last-layer edges are already oriented. That means the yellow cross is complete before the algorithm starts. If the edges are not oriented, ZBLL does not apply; you need an OLL or an edge-orientation step first.
In ZZ, edge orientation is handled early, which makes ZBLL natural. In CFOP, a solver would need to orient edges during F2L (as in ZB or VHLS) to reach a ZBLL state.
472 cases, seven groups
The cases are grouped by corner orientation: T, U, L, S, Anti-Sune, H and Pi. Each group has 40–72 cases depending on symmetry. The library here contains all 472 standard cases with engine verification and alternative algorithms where the source provides them.
The honest cost
ZBLL is a large memorisation project. Most solvers learn COLL and full PLL first, then add ZBLL subsets rather than the entire set. The time saved per solve is real only if recognition is fast; a slow one-look is worse than a fast two-look.
Start with the T and U subsets, which appear frequently and have recognisable patterns. Use spaced repetition and drill recognition separately from execution.
Do not learn ZBLL before F2L and full PLL are fluent. The algorithm count is not the bottleneck; recognition and lookahead are.
Check your understanding
1. What must be true before a ZBLL algorithm applies?
2. How many ZBLL cases are in this library?
3. Which is a sensible prerequisite?