Skip to content

ALS-XY-Wing ​

Loading demo...

An ALS-XY-Wing is a chain of three ALSs (almost locked sets).

How to spot it ​

  • Look for ALSs in the grid.
  • Find three ALSs, ALS1, ALS2, and ALS3, such that ALS1 and ALS2 have RCC x, while ALS2 and ALS3 have RCC y. The digits x and y must be different.
  • If the end ALSs, ALS1 and ALS3, share a candidate z that differs from both x and y, 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-XY-Wing

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

Examples ​

4782428912789189149456895789353589678485678256125789159191678168461514516146164614919124125813281358125856812356158913593681312816158135613418145865312349728323875938567476947972

The grid above contains these three ALSs:

  • ALS1: {R2C3, R2C5, R2C6}, three cells with four distinct candidates {3, 5, 8, 9}.
  • ALS2: {R3C5, R3C7}, two cells with three distinct candidates {1, 5, 9}.
  • ALS3: {R2C8, R3C8, R3C9}, three cells with four distinct candidates {1, 6, 7, 8}.

Every 5 in ALS1 sees every 5 in ALS2, giving them RCC x=5. Likewise, every 1 in ALS2 sees every 1 in ALS3, giving them RCC y=1. These links form a chain with ALS1 and ALS3 at its ends. The end ALSs share candidate 8.

  • If 8 is placed in ALS1, it must be in R2C3 or R2C6. Either placement prevents R2C9, in the same row, from containing 8.
  • If 8 is not placed in ALS1, its three cells are left with {3, 5, 9}, forming a naked triple. One cell must contain 5, which eliminates 5 from ALS2, leaving a naked pair {1, 9}. This in turn eliminates 1 from ALS3, leaving a naked triple {6, 7, 8}. Its 8 prevents R2C9, in the same box, from containing 8.

In either case, we can eliminate 8 from R2C9.


12489128912914914814894891579178915914792889127916716717847834783481241281244919144892498947247279279569125916172789468279279464678478347834581571714837656325345966237855163843135629

The grid above has three ALSs:

  • ALS1: {R7C1, R7C2, R7C9}.
  • ALS2: {R7C7, R8C7, R8C8, R9C8}.
  • ALS3: {R8C4, R8C5}.

ALS1 and ALS2 have RCC x=1, while ALS2 and ALS3 have RCC y=7. The end ALSs, ALS1 and ALS3, share candidates 2 and 9. Both R7C6 and R8C2 see every 2 and every 9 in both end ALSs, so we can eliminate 2 and 9 from both cells.