Aligned Pair Exclusion

Two cells that see each other, or both see the same cell group, form an aligned pair. List every pair of values the two cells could take together. Strike any combination that breaks a rule: both cells the same digit when they see each other, or a combination that would empty a cell, or one that uses up every candidate of a bivalue cell (or an almost locked set) that both cells see. A candidate that appears in no surviving combination is removed.

ALS & exoticsExpert8 min readChapter 8 of the learning path
In one line

Two cells that see each other, or both see the same cell group, form an aligned pair. List every pair of values the two cells could take together. Strike any combination that breaks a rule: both cells the same digit when they see each other, or a combination that would empty a cell, or one that uses up every candidate of a bivalue cell (or an almost locked set) that both cells see. A candidate that appears in no surviving combination is removed.

Removes candidates
Before thisRestricted Common CandidateRestricted common candidate. An almost locked set is N cells in one row, column or box with N + 1 candidates between them, one cell short of a naked subset. Here those sets serve as a test for combinations.
cells the pattern ownscells the deduction touchescandidates that must goGreen cells are the aligned pair. An amber cell or set is the one that rules a combination out. Bold candidates are the digits in play, and struck ones must go. Every empty cell shows its candidates.

How an aligned pair works

Whatever two digits a pair of cells ends up with form one combination. So list every combination their candidates allow and test each against the grid.

The rules come down to two checks. Two cells that see each other can't hold the same digit. And no other cell may be left without a candidate, which happens when the pair takes both digits of a bivalue cell that sees both cells, or two digits of an almost locked set that does.

Each candidate of the pair needs a combination that passes. A candidate in none goes.

The bivalue-cell case

A bivalue cell has two candidates. If it sees both cells of the pair and the pair takes exactly those two digits, it is left empty.

In the figure below, row four, column two holds 1 and 9, and row five, column two holds 2 and 6. Row eight, column two holds 1 and 2 and sees both. So those two cells can't be the 1 and the 2 together.

1A bivalue cell strikes a combination
With the 1 above and the 2 below, row eight, column two would have no candidate left.

When a bivalue cell is not enough

An almost locked set works the same way, one size up: N cells in one house with N + 1 candidates. Take two of its digits away and N cells are left with N − 1 digits. So if every cell of the set sees both cells of the pair, a combination that uses two of its digits fails.

A bivalue cell is the smallest such set. This grid needs bigger ones. On it, every strike that works through bivalue cells alone removes a candidate that a naked pair or naked triple also removes.

Testing a combination against a set is also the first step toward ALS chains, later in this chapter.

How to spot one

Look for two cells that see each other with two to four candidates each. Test against the cells that see both. Keep the pencil marks complete, since a missing candidate can hide a combination that survives. The definition also allows two cells that only see the same group of cells, but the game checks only pairs that see each other.

1

Pick the pair

Row four, column two holds 1 and 9. Row six, column two holds 1, 4 and 6. Both are in column two and box four, so they see each other. Together they allow six combinations.

The aligned pair.
2

Strike the repeated digit

Both cells hold a 1. Cells that see each other can't both be the 1, so 1 with 1 is out.

1 and 1: the same digit twice.
3

Strike 1 with 6

Rows five and eight of column two hold 2 and 6, and 1 and 2. Two cells, three digits: an almost locked set that sees the pair down column two. With the 1 and the 6 taken, both cells would need the 2, and one would be empty.

1 and 6: the set in rows five and eight runs short.
4

Strike 9 with 4

Rows two and seven of column two hold 4 and 7, and 7 and 9, another two-cell set. With the 9 and the 4 taken, both cells would need the 7.

9 and 4: both cells would need the 7.
5

Strike 9 with 6

Box four holds a third set: row four, column one and row five, columns two and three, with 2, 5, 6 and 9 between them. Each cell sees both cells of the pair inside the box. Take away the 9 and the 6, and three cells share only the 2 and the 5.

9 and 6: the box-four set runs short.
6

Remove the 6

Two combinations survive: 1 with 4, and 9 with 1. Neither gives row six, column two the 6, so the 6 goes and the cell keeps 1 and 4. Row four, column two keeps both of its digits.

Only 1 with 4 and 9 with 1 survive. Strike the 6.

The six combinations

Row four, column two first, then row six, column two:

  • 1 and 1: struck, the same digit in two cells that see each other.
  • 1 and 4: survives.
  • 1 and 6: struck, the set in rows five and eight keeps only the 2 for two cells.
  • 9 and 1: survives.
  • 9 and 4: struck, the set in rows two and seven keeps only the 7 for two cells.
  • 9 and 6: struck, the box-four set keeps only the 2 and the 5 for three cells.

Only the 6 appears in no surviving line.

Why it works

In the solution the two cells hold some combination, and it breaks no rule. Every combination that puts the 6 in row six, column two leaves a set with fewer digits than cells. So none of them is the real one, and the 6 can't be right.

How it relates to other moves

When bivalue cells do all the striking, the move can be an XYZ-wing seen from another side. On that article's grid, the game's check for this move pairs the cell that loses the 2 with the pivot, the wings strike its combinations, and the same 2 goes.

With almost locked sets the move often overlaps the restricted common candidate, but not here. On the starting grid no pair of sets removes this 6, and none of the game's wing, coloring, chain or cycle checks from earlier chapters does.

What the in-game hint shows

The in-game hint may show a different or simpler step first. On this grid it opens with a naked pair: row six, columns six and nine hold only 5 and 8, so the rest of row six loses its 5s and 8s. No cell of the pair or its three sets changes.

A naked triple and another naked pair follow, then a 3D Medusa step that strikes this 6 along with many other candidates.

On the starting grid, no step the hint checks before Nishio strikes that 6 on its own. Nishio does. If row six, column two is the 6, row six, column three must be the 4 and row four, column two the 1. Then rows five and eight of column two both need the 2. An ALS chain also removes the 6, and the game checks for one before this move. So the hint seldom shows an aligned pair. A different route can still be right.

1The solution
Row four, column two is the 9 and row six, column two the 1: the surviving combination 9 with 1.
Rule of thumb

List the combinations of two cells that see each other. Strike any that repeat a digit or leave a set seen by both cells short of digits. A candidate with no surviving combination goes.

Where this sits on the path

This is the third technique of the last chapter, after the restricted common candidate. Aligned triple exclusion comes next, the same test with three cells. ALS chains and death blossoms follow later in the chapter.

One question

On a different grid, row nine, columns one and three form an aligned pair. Which candidate does the pair remove?

Row nine, column one holds 5, 6 and 7. Row nine, column three holds 2, 5 and 6. Test each combination against the cells that see both.

Recap

Look for
Two cells that see each other, each with two to four candidates.
Scope
The pair itself, plus the cells that see both of them.
Result
A candidate of the pair goes when every combination that uses it fails.
Tell-tale
One candidate meets each digit of the other cell either as the same digit or inside a small set that sees both cells.
If it fails
If every candidate keeps a surviving combination, try another pair.
0 of 44 techniques understoodBack to libraryNext · ALS Chain
Aligned Pair Exclusion in Sudoku: Test the Combinations