Overlapping ALS-Chain
Loading demo...
An Overlapping ALS-Chain consists of ALSs (almost locked sets) connected in sequence through RCCs, with overlaps allowed between the ALSs. In other words, some ALSs may share cells.
How to spot it
- Look for ALSs in the grid:
ncells in one house with a total ofn+1distinct candidates. Different ALSs may share cells. - Find a sequence of ALSs connected through RCCs (restricted common candidates). For each RCC digit, every occurrence in one ALS must see every occurrence in the other. Label the sequence
ALS1, ALS2, ..., ALS(n-1), ALSn. An RCC must not occur in any cell shared by the two ALSs it connects. Consecutive RCCs must also 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
The reasoning is the same as for an ALS-Chain. The important restriction is that the RCC connecting two ALSs must not occur in a cell they share. Otherwise, the digit could be placed in that shared cell and belong to both ALSs at once. We could no longer deduce that placing the RCC digit in one ALS prevents it from being placed in the other.
Examples
The grid above contains a chain of three ALS nodes:
ALS1:{R7C2, R7C8}.ALS2:{R8C1, R8C3}.ALS3:{R5C2, R6C2, R7C2, R9C2}.
The end ALSs, ALS1 and ALS3, share cell R7C2, but we can still reason along the chain.
ALS1andALS2are connected through RCC5: every5inALS2, atR8C1andR8C3, sees the only5inALS1, atR7C2. AlthoughR7C2also belongs toALS3, other cells inALS3contain candidate5too. For example, the5atR5C2does not see the5s inALS2. So5is an RCC ofALS1andALS2, but not ofALS2andALS3.ALS2andALS3are connected through RCC8. Although the shared cellR7C2also has candidate8,ALS1has another8atR7C8, which does not see the8s inALS2. So8is not an RCC ofALS2andALS1.
In this example, sharing a cell does not make either 5 or 8 an RCC linking ALS2 to both end ALSs. The two distinct RCC links used in the chain remain valid, so the usual ALS-Chain reasoning still applies.
The end ALSs, ALS1 and ALS3, share candidate 1. R7C1 sees every 1 in both, so we can eliminate 1 from that cell.
- If
1is not placed inALS1, it becomes a naked pair, and the effect passes along the chain, locking all its ALSs.1must then be placed inALS3. All its candidate1s are in box7: whether1is placed inR7C2orR9C2, it preventsR7C1from containing1. - If
1is placed inALS1,R7C1, in the same row, cannot contain1.
The grid above contains a chain of three ALS nodes:
ALS1:{R9C2, R9C9}.ALS2:{R6C2, R6C4, R6C9}.ALS3:{R9C9}.
The end ALSs, ALS1 and ALS3, share cell R9C9, which is the whole of ALS3. In other words, ALS3 lies entirely within ALS1. We can still reason along the chain.
ALS1andALS2are connected through RCC7. Their7s are atR9C2andR6C2, respectively, neither of which is the shared cellR9C9.ALS2andALS3are connected through RCC5. Their5s are atR6C9andR9C9, respectively, and see each other. However,ALS1has another5atR9C2, which does not see the5atR6C9. So5is not an RCC ofALS2andALS1.
Here too, the shared cell does not give ALS2 the same RCC connection to both end ALSs. The selected RCCs, 7 and 5, still form a valid ALS-Chain.
The end ALSs, ALS1 and ALS3, share candidate 6. R9C4 sees every 6 in both, so we can eliminate 6 from that cell.