ALS-Chain
Loading demo...
An ALS-Chain consists of ALSs (almost locked sets) connected in sequence through RCCs.
How to spot it
- Look for ALSs in the grid.
- Find a sequence of ALSs connected through RCCs, labeled
ALS1, ALS2, ..., ALS(n-1), ALSn. Consecutive RCCs must be different. For example, the RCC betweenALS1andALS2must differ from the RCC betweenALS2andALS3. - If the end ALSs,
ALS1andALSn, share a candidatezthat differs from the RCCs linking them into the chain, 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, so the RCC digit it shares withALS2must be placed inALS1.ALS2then loses that digit and becomes locked too. Since consecutive RCCs are different, the RCC digit linkingALS2to the next ALS must be placed inALS2. Continuing along the chain eventually locksALSn, wherezmust then be placed. The target cells therefore cannot 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 ALSn, so we can eliminate z from the target cells.
Examples
The grid above contains a chain of four ALS nodes:
ALS1:{R3C1, R3C2, R3C3, R3C4, R3C8}.ALS2:{R2C3}.ALS3:{R8C3, R9C2, R9C3}.ALS4:{R7C7, R8C7, R9C8}.
Their RCCs are 4, 9, 8, in order. The end ALSs, ALS1 and ALS4, share candidate 2. R7C8 sees every 2 in both, so we can eliminate 2 from that cell.
- If
2is placed inALS1, it can only go inR3C8, in column8. This preventsR7C8from containing2. - If
2is not placed inALS1, it becomes a locked set of five cells, which in turn locks every ALS along the chain.2must then be placed inALS4. All its candidate2s lie in box9: whether2is placed inR7C7orR9C8, it preventsR7C8from containing2too.
The grid above contains a chain of seven ALS nodes:
ALS1:{R2C5}.ALS2:{R1C5, R8C5}.ALS3:{R1C1, R1C3, R1C4, R1C8}.ALS4:{R6C1, R6C3, R6C8}.ALS5:{R6C6}.ALS6:{R4C4, R7C4}.ALS7:{R4C9, R7C9}.
Their RCCs are 7, 2, 7, 3, 7, 5, in order. The end ALSs, ALS1 and ALS7, share candidate 2. R2C9 sees every 2 in both, so we can eliminate 2 from that cell.