ALS-XY-Wing
Loading demo...
An ALS-XY-Wing is a chain of three ALSs (almost locked sets).
How to spot it
- Look for ALSs in the grid.
- Find three ALSs,
ALS1,ALS2, andALS3, such thatALS1andALS2have RCCx, whileALS2andALS3have RCCy. The digitsxandymust be different. - If the end ALSs,
ALS1andALS3, share a candidatezthat differs from bothxandy, eliminatezfrom any cell outside the chain that sees everyzin both end ALSs. There may be more than one such common candidatez.
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, soxmust be placed there.ALS2then losesxand becomes locked, forcingyto be placed inALS2. Next,ALS3losesyand becomes locked, sozmust be placed inALS3. Each target cell sees everyzinALS3, 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 ALS3, so we can eliminate z from the target cells.
Examples
The grid above contains these three ALSs:
ALS1:{R2C3, R2C5, R2C6}, three cells with four distinct candidates{3, 5, 8, 9}.ALS2:{R3C5, R3C7}, two cells with three distinct candidates{1, 5, 9}.ALS3:{R2C8, R3C8, R3C9}, three cells with four distinct candidates{1, 6, 7, 8}.
Every 5 in ALS1 sees every 5 in ALS2, giving them RCC x=5. Likewise, every 1 in ALS2 sees every 1 in ALS3, giving them RCC y=1. These links form a chain with ALS1 and ALS3 at its ends. The end ALSs share candidate 8.
- If
8is placed inALS1, it must be inR2C3orR2C6. Either placement preventsR2C9, in the same row, from containing8. - If
8is not placed inALS1, its three cells are left with{3, 5, 9}, forming a naked triple. One cell must contain5, which eliminates5fromALS2, leaving a naked pair{1, 9}. This in turn eliminates1fromALS3, leaving a naked triple{6, 7, 8}. Its8preventsR2C9, in the same box, from containing8.
In either case, we can eliminate 8 from R2C9.
The grid above has three ALSs:
ALS1:{R7C1, R7C2, R7C9}.ALS2:{R7C7, R8C7, R8C8, R9C8}.ALS3:{R8C4, R8C5}.
ALS1 and ALS2 have RCC x=1, while ALS2 and ALS3 have RCC y=7. The end ALSs, ALS1 and ALS3, share candidates 2 and 9. Both R7C6 and R8C2 see every 2 and every 9 in both end ALSs, so we can eliminate 2 and 9 from both cells.