Skip to content

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 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 ​

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 z is not placed in ALS1, that ALS becomes locked, so the RCC digit it shares with ALS2 must be placed in ALS1. ALS2 then loses that digit and becomes locked too. Since consecutive RCCs are different, the RCC digit linking ALS2 to the next ALS must be placed in ALS2. Continuing along the chain eventually locks ALSn, where z must then be placed. The target cells therefore cannot contain z.
  • If z is placed in ALS1, none of the target cells can contain z either, since each sees every z in ALS1.

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 ​

3569566936137136949124126927236715715674571561242671514516461717178147816127146724673598925925237823735859681569151483457857121251282874185398278399623485395614274369

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 2 is placed in ALS1, it can only go in R3C8, in column 8. This prevents R7C8 from containing 2.
  • If 2 is not placed in ALS1, it becomes a locked set of five cells, which in turn locks every ALS along the chain. 2 must then be placed in ALS4. All its candidate 2s lie in box 9: whether 2 is placed in R7C7 or R9C8, it prevents R7C8 from containing 2 too.

23623676824747238367913696827571237812358125712274571247125237371231236936936236267372361235351251251269269125695747479126781268369356937967575194893654689145278819547486938214

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.