Skip to content

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: n cells in one house with a total of n+1 distinct 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 between ALS1 and ALS2 must differ from the RCC between ALS2 and ALS3.
  • If the end ALSs, ALS1 and ALSn, share a candidate z that differs from the RCCs linking them into the chain, eliminate z from any cell outside the chain that sees every z in both end ALSs. There may be more than one such common candidate z.
ALS-Chain

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 ​

14578457814784758478247782815785781212785789258957895789147579159494524525959579457145147145912459158242455918458458458278157857892585918293696351364362613872863376691723634

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.

  • ALS1 and ALS2 are connected through RCC 5: every 5 in ALS2, at R8C1 and R8C3, sees the only 5 in ALS1, at R7C2. Although R7C2 also belongs to ALS3, other cells in ALS3 contain candidate 5 too. For example, the 5 at R5C2 does not see the 5s in ALS2. So 5 is an RCC of ALS1 and ALS2, but not of ALS2 and ALS3.
  • ALS2 and ALS3 are connected through RCC 8. Although the shared cell R7C2 also has candidate 8, ALS1 has another 8 at R7C8, which does not see the 8s in ALS2. So 8 is not an RCC of ALS2 and ALS1.

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 1 is not placed in ALS1, it becomes a naked pair, and the effect passes along the chain, locking all its ALSs. 1 must then be placed in ALS3. All its candidate 1s are in box 7: whether 1 is placed in R7C2 or R9C2, it prevents R7C1 from containing 1.
  • If 1 is placed in ALS1, R7C1, in the same row, cannot contain 1.

367346734783578683534613481241238136837137151353635613581586956593735713153473671461714647567168124612815627567467927945275619259782694427928134798426258993183

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.

  • ALS1 and ALS2 are connected through RCC 7. Their 7s are at R9C2 and R6C2, respectively, neither of which is the shared cell R9C9.
  • ALS2 and ALS3 are connected through RCC 5. Their 5s are at R6C9 and R9C9, respectively, and see each other. However, ALS1 has another 5 at R9C2, which does not see the 5 at R6C9. So 5 is not an RCC of ALS2 and ALS1.

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.