sudokUI › Sudoku techniques › ALS-XZ
ALS-XZ in sudoku
ALS chain of two sets · VWXYZ-Wing is a special case · how it fits
Two almost locked sets, each within one unit and sharing no cell, both contain two digits, X and Z, and every X in one sees every X in the other.
Why it works
X cannot be placed in both sets, so at least one set is left with as many candidates as cells and must contain Z. So Z is removed from every cell outside both sets that sees every Z in both sets.
How to spot it
Start with small sets such as bivalue cells, find two that share two digits, then test whether one digit's cells all see each other.
Worked example
ALS-XZ: sets A (r8c2, r9c1) and B (r7c8, r8c9) each hold one digit more than they have cells, and every 1 of A sees every 1 of B, so at most one of them keeps a 1. The other loses its 1, its other digits fill its cells, and it holds a 5: A or B holds a 5, so 5 is removed from every cell that sees every 5 of both. Here, 5 is removed from r7c1.
Practise it on a real puzzle. sudokUI generates a puzzle that needs ALS-XZ and takes you straight to the position where it applies. Hints draw the pattern on the board and explain the step.
In a puzzle's HoDoKu rating
Each time the solver needs ALS-XZ, the puzzle's HoDoKu rating grows by 300. Its class is Unfair. It is needed in 1 in 37 puzzles that sudokUI generates. How the HoDoKu rating works.