What it is
Two kinds of link hold a chain together. A strong link joins two candidates of which at least one must be true: the only two options left in a square, or the only two places left for a digit in a row, column or box. If one is false, the other is true. A weak link joins two candidates that cannot both be true: two digits in the same square, or the same digit in two squares that see each other. If one is true, the other is false.
A chain alternates: strong, weak, strong, weak, strong. Start by supposing the first candidate is false. The strong link makes the second candidate true; the weak link makes the third false; the next strong link makes the fourth true, and so on. An X-Chain uses one digit throughout, linking places in rows, columns and boxes. An alternating inference chain, or AIC, may switch digits inside a square along the way.
How to spot it
Chains grow out of strong links, so start by marking them: squares with exactly two candidates, and digits with exactly two places in a group. A square or digit with two options is a hinge where supposing one false forces the other true.
Pick a candidate to suppose false, follow a strong link to a candidate that becomes true, then a weak link to one that becomes false, and continue. Stop when the candidate you have just made true and the one you started from both see the same third candidate, or when the chain returns to the digit it started from. The shared candidate is the one to remove.
- Mark the strong links: two-candidate squares and digits with exactly two places in a group.
- Suppose a candidate is false and follow a strong link to a candidate that is now true.
- Follow a weak link from it to a candidate that is now false, and alternate.
- When a candidate sees both the start and the end of the chain, remove it.
Why it works
Call the first candidate A and the last Z. The chain shows that if A is false then Z is true. There are only two possibilities for A: either A is true, or A is false and then Z is true. So at least one of A and Z is true in every case. A candidate that sees both A and Z would be ruled out by whichever of them is true, so it can be removed now, without knowing which.
When the chain loops back to the digit it started from, the result is stronger: supposing A false leads to a contradiction, so A must be true, and the coach places it. The in-game explanation walks the whole chain in order, so you can check every link against the board.
Worked example
Both examples come from daily puzzles after the singles are placed. The first is an X-Chain on the digit 9. Supposing one square is not 9 forces a 9 at the only other place in its column, which rules out a 9 in that square’s box, which in turn forces a 9 at the only other place in that row. One of the two end squares is therefore 9, and the square at the corner of their row and column, which sees both, loses its 9.
The second is an alternating inference chain that switches digits inside squares. Supposing a square is not 4 makes it 6, which removes a 6 from a neighbouring square and makes that square 3, which removes a 3 further along and forces a 3 at the only other place in its row. Either the first square is 4 or the last square is 3, and since the last square sees the first, it cannot be 4. That removal leaves it with a single candidate. In both diagrams the shaded squares are the chain, the bold marks its links, and the struck-through mark is the removal.
Suppose row 1, column 4 isn't 9. Then row 8, column 4 must be 9 (the only other place for 9 in column 4), so row 7, column 6 isn't 9. Then row 7, column 1 must be 9 (the only other place for 9 in row 7). So either row 1, column 4 is 9 or row 7, column 1 is 9, and row 1, column 1 can't be 9.
From the daily puzzle of 11 September 2026, after the singles are placed. Play this puzzle
Shaded squares form the pattern. Bold small numbers are the pattern’s candidates. Struck-through numbers are removed by this deduction. Bold large digits are the puzzle’s givens.
Suppose row 1, column 5 isn't 4. Then it must be 6 (its only other option), so row 2, column 4 isn't 6. Then it must be 3 (its only other option), so row 4, column 4 isn't 3. Then row 4, column 5 must be 3 (the only other place for 3 in row 4). So either row 1, column 5 is 4 or row 4, column 5 is 3, and row 4, column 5 can't be 4.
From the daily puzzle of 29 April 2026, after the singles are placed. Play this puzzle
Shaded squares form the pattern. Bold small numbers are the pattern’s candidates. Struck-through numbers are removed by this deduction. Bold large digits are the puzzle’s givens.
Common mistakes
Treating a weak link as strong is the most common error. Two candidates that merely cannot both be true tell you nothing when one of them is false; only a genuine either-or, with exactly two options, lets you move from false to true.
A chain must alternate. A weak link can never stand where a strong one is needed: once a candidate is false, only a strong link tells you what becomes true. Two weak links in a row break the inference, so count the links as you go.
The conclusion is about the two ends. The chain removes a candidate that sees both of them, or proves the start true when the chain returns to it. It does not place any of the digits along the way; those stay as candidates until later singles decide them.
Where it appears in Sudoku Dawn
Chains of up to six candidates, that is three strong links, are Expert techniques here, tried after the wings. The solver looks for the shortest chain that removes something, so the coach’s chains are as short as the position allows. A few daily puzzles need longer chains; they are still labelled Expert, and the coach titles them A longer chain.
The coach titles the short versions An X-Chain and A chain of deductions. The nudge invites you to suppose a square is not a certain number and follow what that forces; the explanation then writes out every step as a sentence, ending with the two ends of the chain and the removal they justify, before continuing to the single it exposes.