ALS-XZ Rule
Loading demo...
ALS-XZ is a chain of two ALSs (almost locked sets).
How to spot it
- Look for ALSs in the grid:
ncells in one house with a total ofn+1distinct candidates. - Find two ALSs with at least two common candidates. Choose one as
xand consider each of the others asz. - If every
xin one ALS sees everyxin the other,xis their RCC (restricted common candidate), and the two ALSs form an ALS-XZ pattern. - Eliminate
zfrom any cell outside the two ALSs that sees everyzin both.
How it works
An ALS (almost locked set) consists of n cells in one house with a total of n+1 distinct candidates. If we establish or assume that none of those cells can contain a particular digit, the ALS loses that candidate digit and becomes a locked set: n cells with n candidates. It can then be used for eliminations through the subset principle.
An RCC (restricted common candidate) is a candidate shared by two ALSs, with every occurrence in one ALS seeing every occurrence of the same digit in the other. If the RCC digit is placed in neither ALS, both lose it and become locked. If it is placed in one ALS, the other cannot contain it and becomes locked.
- If
zis not placed inALS1, that ALS becomes locked, so RCC digitxmust be placed there.ALS2then losesxand becomes locked too, forcingzto be placed inALS2. Each target cell sees everyzinALS2, so none of the target cells can containz. - If
zis placed inALS1, none of the target cells can containzeither, since each sees everyzinALS1.
In either case, z must be placed in at least one of ALS1 and ALS2, so we can eliminate z from the target cells.
Examples
The grid above contains these two ALSs:
ALS1:{R7C2, R7C8, R7C9}, three cells with four distinct candidates{1, 4, 8, 9}.ALS2:{R9C2, R9C7, R9C8}, three cells with four distinct candidates{3, 4, 8, 9}.
Every 4 in ALS1 sees every 4 in ALS2, making 4 their RCC and forming an ALS-XZ pattern.
The ALSs also share candidates 8 and 9. We can check each for possible eliminations.
For candidate 8, R7C1 sees every 8 in both ALSs.
- If
8is placed inALS1, it must be inR7C2orR7C9. Either placement preventsR7C1, in the same row, from containing8. - If
8is not placed inALS1, its three cells are left with{1, 4, 9}, forming a naked triple. One of them must contain4, which can only go inR7C8orR7C9. Either placement eliminates4fromR9C7andR9C8in the same box.ALS2is then left with{3, 8, 9}, forming another naked triple. Its8must be placed inR9C2. This preventsR7C1, in the same box, from containing8.
In either case, we can eliminate 8 from R7C1.
For candidate 9, no cell outside the two ALSs sees every 9 in both, so there is no elimination for 9.
The grid above has two ALSs: {R1C2, R2C2, R9C2} and {R5C3, R6C1, R6C2}. Their RCC is 7, and their other common candidates are 1 and 5.
- Both
R4C2andR5C2see every5in both ALSs, so we can eliminate5from both cells. R5C2also sees every1in both ALSs, so we can eliminate1from that cell too.