Forcing Chains in Sudoku

Try every option for one square or one digit, follow the singles, and keep what every branch agrees on.

Home › Blog › Forcing Chains

Written by Brian Hamilton and Karan Hamilton.

Brian and Karan are the puzzle lovers and game makers behind Sudoku Online Puzzles. You can learn more on the About page.

Guides are reviewed for clarity, accuracy, and usefulness for solvers. See our editorial standards, puzzle testing process, or send a correction.

In the first puzzle below, R5C9 can only be 1 or 2, and nothing on the board says which. Put a 1 there and follow the singles: two moves later a 6 has to go in R3C8. Put a 2 there instead, and two different singles put the 6 in R3C8 again. You still don’t know R5C9, but you know R3C8. That is a forcing chain: if this, then that, followed for every option there is, keeping only what all the options agree on.

We wrote a detector that builds forcing chains from nothing but naked singles and hidden singles, and ran it on the first 500 puzzles of our Evil bank, at every point where the eighteen techniques of our sudoku helper ran out. It found a forcing chain every time. It also showed which kind it was finding, and that part is less flattering: two moves in three were contradiction chains, the kind closest to trial and error. The three boards on this page come from that run.

What is a forcing chain in sudoku?

A forcing chain is proof by cases. Pick something with only a few options: a square with two or three candidates, or a digit with two or three places left in a row, column or box. One of those options is true. Follow each in turn, one forced move at a time. If every branch ends with the same digit in the same square, or the same candidate removed, that result holds whichever option turns out to be right.

A contradiction chain, the third kind in the table below, follows a single option and waits for the board to break: a square left with no candidates, or a row, column or box with no place for a digit it still needs. An option that breaks the board is false.

KindWhat you tryExample below
Cell forcing chainEvery candidate of one square; keep what all of them forceR5C9 is 1 or 2, and both put a 6 in R3C8
Digit forcing chainEvery place for one digit in a row, column or box; keep what all of them forceBoth places for the 6 in row 4 take the 9 out of R9C2
Contradiction chain (Nishio)One candidate; remove it if it breaks the boardA 3 in R5C8 leaves row 5 with nowhere for a 5

All three examples are real Evil puzzles at the point where our helper’s eighteen techniques stall, and every conclusion was checked against the puzzle’s solution.

You have probably run one already without the name. An XY-Wing is a cell forcing chain whose branches are one step long: whichever digit the pivot takes, one of the two pincers is left holding the third digit, so any square that sees both pincers loses it.

What counts as a step

Here, and in the detector behind every number on this page, a step is a naked single (a square down to one candidate) or a hidden single (a digit down to one place in a row, column or box, which solvers call a house). Nothing cleverer, so each step can be checked by looking at one square or one house. That is the difference between a forcing chain you can follow and one you take on trust. The detector also drops branches longer than 10 steps and tries at most three options from any one square or house.

How does a cell forcing chain work?

Here is the opening example on its own board, line 223 of our Evil bank, after the helper’s eighteen techniques have placed all they can and stalled with 42 squares open. R5C9 holds only 1 and 2, so it is the source, and each branch gets its own grid. How to read the diagrams: digits drawn large are the ones a branch places, blue for the assumption and green for what it forces. A solid arrow leads to the next square the branch fills. A dashed arrow is a placed digit removing a candidate, struck through, from a square it sees.

Cell forcing chain from R5C9, Evil puzzle 223 — before Cell forcing chain from R5C9, Evil puzzle 223 — branch 1, suppose R5C9 = 1. pattern cells R2C9, R3C8. pivot R5C9. A real puzzle from our Evil bank (line 223), where our helper’s eighteen techniques stall with 42 squares open. R5C9 can only be 1 or 2. Branch 1: suppose it is 1 (blue). Step 1: R5C9 no longer takes the 2, so the only 2 left in column 9 is R2C9. Step 2: R2C9 = 2 can’t also be 6, so the only 6 left in box 3 is R3C8. Digits drawn large are the ones this branch places, in arrow order. Candidates are drawn in column 9 and box 3, the houses this branch uses.. 2 8 6 1 3 4 3 4 9 7 4 1 2 3 8 2 8 4 2 1 3 6 5 5 4 1 6 9 8 3 9 7 4 8 6 5 1 2 6 8 9 1 3 4 2 7 8 1 3 6 8 2 6 4 9 8 4
A real puzzle from our Evil bank (line 223), where our helper’s eighteen techniques stall with 42 squares open. R5C9 can only be 1 or 2. Branch 1: suppose it is 1 (blue). Step 1: R5C9 no longer takes the 2, so the only 2 left in column 9 is R2C9. Step 2: R2C9 = 2 can’t also be 6, so the only 6 left in box 3 is R3C8. Digits drawn large are the ones this branch places, in arrow order. Candidates are drawn in column 9 and box 3, the houses this branch uses.
Cell forcing chain from R5C9, second branch, Evil puzzle 223 — before Cell forcing chain from R5C9, second branch, Evil puzzle 223 — branch 2, suppose R5C9 = 2. pattern cells R9C8, R3C8. pivot R5C9. candidates removed: 2 in R4C8. Branch 2: suppose R5C9 is 2 (blue). Step 1: that 2 removes the 2 from R4C8 in the same box (dashed arrow, struck), so the only 2 left in column 8 is R9C8. Step 2: R9C8 = 2 can’t also be 6, so the only 6 left in column 8 is R3C8. Same square, same digit as branch 1. Candidates are drawn in column 8.. 2 8 6 3 4 9 7 4 8 8 4 2 6 5 5 4 1 6 9 2 3 7 8 3 9 7 4 8 6 5 2 2 6 8 9 4 7 4 2 7 8 1 8 2 6 4 3 7 9 8 2 4
Branch 2: suppose R5C9 is 2 (blue). Step 1: that 2 removes the 2 from R4C8 in the same box (dashed arrow, struck), so the only 2 left in column 8 is R9C8. Step 2: R9C8 = 2 can’t also be 6, so the only 6 left in column 8 is R3C8. Same square, same digit as branch 1. Candidates are drawn in column 8.

Each branch is two hidden singles long, and they get there through different houses: column 9 and box 3 in the first, column 8 twice in the second. Only where they end matters. These two agree on more than R3C8: our detector lists several other squares both fill the same way, R7C9 = 6 just as quickly. One is enough, because the rest follow from it.

Cell forcing chain from R5C9, Evil puzzle 223 — after Cell forcing chain from R5C9, Evil puzzle 223 — after the forcing chain, R3C8 = 6. pattern cells R3C8, R7C9. R5C9 has to be 1 or 2, and both branches end with a 6 in R3C8, so R3C8 = 6 whichever it is. Placing it removes the 6 from R2C9 and R9C8, which leaves R7C9 as the only 6 in column 9: the singles are back. From here our helper’s eighteen techniques finish the puzzle on their own, in 51 moves.. 2 8 6 1 3 4 3 4 9 7 4 1 2 3 8 1 2 3 8 4 2 1 3 6 5 5 4 1 6 9 2 3 7 8 3 9 7 4 8 6 5 1 2 2 6 8 9 4 7 1 3 4 2 7 8 1 3 6 8 2 6 4 3 7 9 8 2 3 7 4
R5C9 has to be 1 or 2, and both branches end with a 6 in R3C8, so R3C8 = 6 whichever it is. Placing it removes the 6 from R2C9 and R9C8, which leaves R7C9 as the only 6 in column 9: the singles are back. From here our helper’s eighteen techniques finish the puzzle on their own, in 51 moves.

No pattern, no colouring: just “where else can this digit go?” and “what is left in this square?”, asked four times. To try it yourself, open the puzzle in the helper and take hints until it reports no logical technique; that is the position in the diagrams.

What is a digit or unit forcing chain?

A digit forcing chain starts from a house instead of a square. In row 4 of the next board, line 62 of the Evil bank, the 6 has two places left, R4C1 and R4C9. One of them holds the 6, so follow both. Some guides call this a unit forcing chain, after the row, column or box it starts from; it is the cell forcing chain with the roles of square and digit swapped.

Digit forcing chain on the 6s of row 4, Evil puzzle 62 — before Digit forcing chain on the 6s of row 4, Evil puzzle 62 — the two places for 6 in row 4. pattern cells R9C9. pivot R4C1, R4C9. eliminations in R9C2. candidates removed: 9 in R9C2. Another Evil puzzle (line 62), stalled with 41 squares open. Row 4 has two places for a 6, R4C1 and R4C9 (blue). If R4C1 is 6, it removes the 6 from R9C1 below it, so R9C2 is the only 6 left in row 9 (green arrow). If R4C9 is 6, it isn’t 9, so R9C9 is the only 9 left in column 9 (blue arrow). Either way R9C2 cannot be 9 (red, struck): in the first case it holds the 6, in the second it shares row 9 with the 9. Candidates are drawn in rows 4 and 9 and column 9.. 3 9 6 5 4 8 4 5 6 7 8 1 3 9 2 8 5 3 1 4 6 6 8 9 3 4 8 9 1 2 8 9 4 7 8 9 5 6 7 8 9 2 7 3 5 1 6 4 7 2 3 7 6 3 5 9 6 1 7 8 3 5 6 7 8 2 6 7 9 2 5 8 9 2 8 1 3 5 2 7 8 9 4 7 8 9
Another Evil puzzle (line 62), stalled with 41 squares open. Row 4 has two places for a 6, R4C1 and R4C9 (blue). If R4C1 is 6, it removes the 6 from R9C1 below it, so R9C2 is the only 6 left in row 9 (green arrow). If R4C9 is 6, it isn’t 9, so R9C9 is the only 9 left in column 9 (blue arrow). Either way R9C2 cannot be 9 (red, struck): in the first case it holds the 6, in the second it shares row 9 with the 9. Candidates are drawn in rows 4 and 9 and column 9.
Digit forcing chain on the 6s of row 4, Evil puzzle 62 — after Digit forcing chain on the 6s of row 4, Evil puzzle 62 — after the elimination. pattern cells R9C2. The 9 is gone from R9C2, which is down to 2, 6 or 7. On this board one elimination is not enough: our helper’s eighteen still find nothing, so the next step is another chain.. 3 9 6 5 4 8 4 5 6 7 8 1 3 9 2 8 5 3 1 4 6 6 8 9 3 4 8 9 1 2 8 9 4 7 8 9 5 6 7 8 9 2 7 3 5 1 6 4 7 2 3 7 6 3 5 9 6 1 7 8 3 5 6 7 8 2 6 7 2 5 8 9 2 8 1 3 5 2 7 8 9 4 7 8 9
The 9 is gone from R9C2, which is down to 2, 6 or 7. On this board one elimination is not enough: our helper’s eighteen still find nothing, so the next step is another chain.

Both branches are a single step, and they reach R9C2 by different roads: one fills it with a 6, the other puts a 9 elsewhere in its row. Different routes, same casualty. The branches never have to place the same digit; it is enough that each, for its own reason, rules out the same candidate.

It also shows how small the gain from one chain can be. The 168 Evil puzzles in our sample that the eighteen couldn’t finish stalled 808 times between them, nearly five times each. A hard puzzle needs a handful of these, not one.

What is a contradiction chain, or Nishio?

The third kind tests one candidate. Suppose it is true, follow the singles, and see whether the board survives. If it doesn’t, the candidate is false. Solvers often call this Nishio, a name usually credited to the Japanese puzzle author Tetsuya Nishio.

Contradiction chain from a 3 in R5C8, Evil puzzle 39 — before Contradiction chain from a 3 in R5C8, Evil puzzle 39 — testing R5C8 = 3. pattern cells R5C1, R6C3. pivot R5C8. candidates removed: 5 in R5C2. An Evil puzzle (line 39) stalled with 52 squares open. Test a 3 in R5C8 (blue). Step 1: with R5C8 taken, the only 8 left in row 5 is R5C1. Step 2: R5C1 = 8 removes the 8 from R6C3 in its box, leaving it only 5. That 5 removes the 5 from R5C2 in the same box (struck), and now row 5 has no place left for a 5. Digits drawn large are the ones the test places. Candidates are drawn in row 5 and R6C3.. 3 8 1 9 8 9 2 6 4 9 6 7 8 5 8 1 2 5 4 1 2 6 1 2 3 1 3 6 9 3 7 3 5 9 7 1 6 2 9 7 4 2 3 5
An Evil puzzle (line 39) stalled with 52 squares open. Test a 3 in R5C8 (blue). Step 1: with R5C8 taken, the only 8 left in row 5 is R5C1. Step 2: R5C1 = 8 removes the 8 from R6C3 in its box, leaving it only 5. That 5 removes the 5 from R5C2 in the same box (struck), and now row 5 has no place left for a 5. Digits drawn large are the ones the test places. Candidates are drawn in row 5 and R6C3.
Contradiction chain from a 3 in R5C8, Evil puzzle 39 — after Contradiction chain from a 3 in R5C8, Evil puzzle 39 — after the contradiction, R5C8 is not 3. pattern cells R5C8. The test broke row 5, so R5C8 is not 3. It is down to 5 or 8.. 3 8 1 9 8 9 2 6 4 9 6 7 8 5 1 2 5 8 1 2 5 4 1 2 6 1 2 3 1 3 6 9 5 8 7 3 5 8 9 7 1 6 2 9 7 4 2 3 5
The test broke row 5, so R5C8 is not 3. It is down to 5 or 8.

Now look at R6C3 in the same position. It holds only 5 and 8, and as a cell forcing chain it gives the same result in one step per branch: if it is 5, R5C8 is the only 5 left in row 5; if it is 8, R5C8 is the only 8 left in row 5. Either way R5C8 is 5 or 8, never 3. A short contradiction often has an ordinary forcing chain behind it, run backwards. When you find one, look for the other: the version with two branches is easier to explain to anyone checking your work, including you.

How do you run a forcing chain by hand?

  1. Make the candidates exact first. Every step leans on “this is the only place left”, and one missing candidate makes a false branch look sound.
  2. Choose a source with two options: a square with two candidates, or a digit with two places in a house. Three options work but cost a third branch. Of the 206 cell and digit chains our solver used, only 12 needed three.
  3. Follow singles only, and name the reason for each. “R2C9 = 2, the last 2 in column 9” is a step. “R2C9 looks like a 2” is not.
  4. Stop a branch at four steps. If nothing useful has landed by then, drop it and pick another source. On our Evil stalls that rule costs very little; see the table below.
  5. Compare. Look for a square every branch fills with the same digit, or a candidate every branch removes. When testing a single candidate, look instead for a square with no candidates left or a digit with no home in some house.
  6. Keep the branches apart on paper. Two colours of pencil, or a copy of the grid for each branch. Two branches mixed on one grid is how a forcing chain turns into a mistake.
Longest branch allowedAny of the three kindsCell or digit chain only
2 steps485 (60%)315 (39%)
3 steps704 (87%)461 (57%)
4 steps790 (97.8%)566 (70%)
6 steps808 (100%)658 (81%)

How many of the 808 positions where our helper’s eighteen techniques stalled, across the first 500 puzzles of our Evil bank, had a forcing chain within each length. Steps are naked and hidden singles; at most three options per source. The gap between the columns is the contradiction chains.

Is a forcing chain just guessing?

A guess commits. You write a digit in, carry on as if it were right, and if the puzzle breaks you rub out back to the guess, often through twenty moves you can no longer tell apart from the ones before it. A cell or digit forcing chain never commits: every option is followed on its own grid, and only the result they share goes on the real board. “R5C9 is 1 or 2, and either way R3C8 is 6” is not a guess.

Contradiction chains are another matter. Following one candidate until it breaks is trial and error; what makes it acceptable is the length. The contradiction chains our solver used mostly ran 2 to 4 steps (353 of 397) and never more than 6, and each fits on one checkable line: R5C8 = 3, so R5C1 = 8, so R6C3 = 5, so row 5 has no 5.

That changes how to read our headline result. Forcing chains finished every Evil puzzle in the sample, but of the 603 times our solver needed one, 397 were contradiction chains, 115 digit chains and 91 cell chains. The 100% is mostly short, checkable trial and error. Our line: if the reason fits on one line of singles, it is a deduction you can show someone. If you have to play on until the puzzle is solved, or breaks far from where you started, it is a guess, however well it turns out.

Our helper sits on the far side of that line when it runs out. Past its eighteen techniques it does not look for a chain at all: it solves the grid by backtracking and hands you one square’s answer, labelled Trial & Error. A short contradiction chain is the honest version of that hint.

What is the difference between a forcing chain and a forcing net?

In a chain, every step follows from the one before it. In a net, a step needs two earlier steps at once, typically a hidden single that only appears after two different placements have each removed a candidate. Nets are just as sound, only harder to write down, because they branch inside a branch.

Our detector labels every branch it traces. Among the moves our solver used, nets were uncommon in cell chains (12 of 91) and digit chains (19 of 115) and the rule in contradictions (364 of 397): a board usually breaks where two lines of consequences meet. The R5C8 example is one of the few contradictions whose steps run in a single line. By hand, treat a net like a long branch: allowed, but write each step down.

Simple colouring and 3D Medusa are forcing nets with the bookkeeping done for you. Every link they use is two-way, so two colours carry both branches at once, and whatever both colours agree on is safe.

Tried every pattern you know and still stuck on an Evil puzzle?

That is where forcing chains earn their place, and we can say how often it happens. The helper’s eighteen techniques run from singles through X-Wing, W-Wing and almost locked sets. Taking the simplest move each time, they finish 332 of the first 500 Evil puzzles. At every stall we then tried four more techniques, in this order:

Techniques allowedEvil puzzles solved, of 500
The helper’s eighteen332 (66.4%)
+ BUG333
+ X-chains and X-cycles347
+ XY-chains377
+ forcing chains500 (100%)

First 500 puzzles of our Evil bank, simplest technique first. The four extra techniques are tried in this order at every stall, so a later one is used only where the earlier ones found nothing; in another order the rows would split differently. X-chains here use single squares only, XY-chains two-candidate squares only.

A forcing chain was there at every one of the 808 stalls, including all 603 where BUG, X-chains and XY-chains found nothing. Every deduction the detector returned along the way, 186,521 of them, was checked against the puzzle’s solution, and none was wrong.

What to look for first

At the first stall of the 168 Evil puzzles the eighteen couldn’t finish, an X-chain was available 34% of the time, an XY-chain 26%, BUG once, and a forcing chain every time. X-chains and XY-chains are forcing chains with restrictions, one digit or two-candidate squares throughout, and they are quicker to spot, so give them a minute. Then try cell and digit chains: across all 808 stalls, one with branches of four singles or fewer was there 70% of the time. Contradiction tests come last. A test that short was there 98% of the time, which is exactly why they carry most of the 100%.

If any of the eighteen still feel slow, the sudoku trainer drills them on real positions. A forcing chain is slow work, and it should never stand in for a pair you missed.

Why don’t forcing chains crack Extreme puzzles?

On our Extreme bank they do nothing at all, and the reason shows before the first move. Of the first 500 Extreme puzzles, the helper’s eighteen finish one. The other 499 stall at the starting position, with 57.5 empty squares and 0.6 two-candidate squares on average. A forcing chain needs something close to forced to start from and singles to follow; here there is neither. None of the four techniques fired on any of the 499, even with forcing chains allowed up to nine options per source and no limit on branch length.

Those puzzles need much deeper search: chains whose steps are themselves the results of other chains. Sudoku Explainer, which rates puzzles by the hardest human step they need, scores plain forcing chains 7.1 to 7.5; 4,980 of the 5,000 puzzles on our Extreme page rate above 11.0. The famous grids at the very top, Arto Inkala’s among them, are on the hardest sudoku ever page. Evil is where forcing chains made of singles finish puzzles, and the place to practise them.