Skip to content

ALS-XZ Rule ​

Loading demo...

ALS-XZ is a chain of two ALSs (almost locked sets).

How to spot it ​

  • Look for ALSs in the grid: n cells in one house with a total of n+1 distinct candidates.
  • Find two ALSs with at least two common candidates. Choose one as x and consider each of the others as z.
  • If every x in one ALS sees every x in the other, x is their RCC (restricted common candidate), and the two ALSs form an ALS-XZ pattern.
  • Eliminate z from any cell outside the two ALSs that sees every z in both.
ALS-XZ

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 RCC digit x must be placed there. ALS2 then loses x and becomes locked too, forcing z to be placed in ALS2. Each target cell sees every z in ALS2, so none of the target cells can 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 ALS2, so we can eliminate z from the target cells.

Examples ​

123836823679123679291367137913623691236912469249134913612312346712461346713473578378158181335939235623562647473839138913168918956945689141489137893478794789489134893678938934678246789246894934457589856492182475623756215

The grid above contains these two ALSs:

  • ALS1: {R7C2, R7C8, R7C9}, three cells with four distinct candidates {1, 4, 8, 9}.
  • ALS2: {R9C2, R9C7, R9C8}, three cells with four distinct candidates {3, 4, 8, 9}.

Every 4 in ALS1 sees every 4 in ALS2, making 4 their RCC and forming an ALS-XZ pattern.

The ALSs also share candidates 8 and 9. We can check each for possible eliminations.

For candidate 8, R7C1 sees every 8 in both ALSs.

  • If 8 is placed in ALS1, it must be in R7C2 or R7C9. Either placement prevents R7C1, in the same row, from containing 8.
  • If 8 is not placed in ALS1, its three cells are left with {1, 4, 9}, forming a naked triple. One of them must contain 4, which can only go in R7C8 or R7C9. Either placement eliminates 4 from R9C7 and R9C8 in the same box. ALS2 is then left with {3, 8, 9}, forming another naked triple. Its 8 must be placed in R9C2. This prevents R7C1, in the same box, from containing 8.

In either case, we can eliminate 8 from R7C1.

For candidate 9, no cell outside the two ALSs sees every 9 in both, so there is no elimination for 9.


167157157367136715156715671868916789167687818589457847589789241258915867478568356891356891378915157856856781568258458243583824158125145568956896891561561589423243429563123924769137983472

The grid above has two ALSs: {R1C2, R2C2, R9C2} and {R5C3, R6C1, R6C2}. Their RCC is 7, and their other common candidates are 1 and 5.

  • Both R4C2 and R5C2 see every 5 in both ALSs, so we can eliminate 5 from both cells.
  • R5C2 also sees every 1 in both ALSs, so we can eliminate 1 from that cell too.