Skip to content

ALS-XZ (2 RCCs) ​

Loading demo...

ALS-XZ (two RCCs) is a pattern formed by two ALSs (almost locked sets) with two RCCs between them.

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, ALS1 and ALS2, with at least two common candidates. Choose two of those candidates as x and z.
  • If every x in one ALS sees every x in the other, x is one of their RCCs (restricted common candidates).
  • If every z in one ALS also sees every z in the other, z is a second RCC. The two ALSs then form an ALS-XZ pattern with two RCCs.

This pattern allows two kinds of eliminations:

  • x and z must be placed within the two ALSs, one in each. Outside the pair, eliminate x from any cell that sees every x in both ALSs, and eliminate z from any cell that sees every z in both.
  • Both ALSs become locked by losing the RCC digit placed in the other. For each candidate other than x or z in either ALS, eliminate that digit from any cell outside that ALS that sees all its candidate positions within the ALS.
Eliminations from ALS-XZ with two RCCs

How it works ​

First, at least one of x and z must be placed in each ALS. If neither were placed there, it would go from n cells with n+1 candidates to n cells with only n-1 candidates. There would not be enough distinct digits to fill the cells without repetition, violating Sudoku rules.

On the other hand, both x and z are RCCs, so neither digit can be placed in both ALSs. The only possibilities are therefore x in ALS1 and z in ALS2, or x in ALS2 and z in ALS1.

This confines x to ALS1 or ALS2. We do not know its exact position, but any cell that sees every x in both ALSs cannot contain x. The same applies to z.

Second, each ALS loses the RCC digit placed in the other, so both become locked naked subsets. We do not yet know whether x is placed in ALS1 or ALS2, but every other candidate digit must be placed within its own ALS. For each candidate other than x or z in ALS1, we can eliminate that digit from any cell outside ALS1 that sees all its candidate positions within ALS1. The same applies to ALS2.

Examples ​

363823834623462358356823682823636938934684834623459369235345245923625234513612358124824523467236712513934512342459234393793894789472591791896781682789257125235937132792575971714927158719768625143846

The grid above contains two ALSs: ALS1: {R1C1, R1C2, R1C4, R1C5} and ALS2: {R4C4, R4C5, R6C5}. They have two RCCs, 2 and 4, forming an ALS-XZ pattern with two RCCs.

  • Both R2C4 and R5C4 see every RCC occurrence of 2 in both ALSs, so we can eliminate 2 from both cells.
  • R1C8 sees every 3 and every 6 in ALS1. Neither digit is an RCC, so we can eliminate both from R1C8.
  • R5C4 sees every 3 and every 5 in ALS2, while R6C6 sees every 3 in ALS2. These are also non-RCC candidates, so we can eliminate 3 and 5 from R5C4, and 3 from R6C6.