What is a forcing chain
A forcing chain is a step-by-step logical trail you build from a single assumption: if candidate X is true in one cell, what must follow in other cells? You follow the chain of consequences — strong links (where only two places remain for a digit) and weak links (where two candidates share a house and one excludes the other) — until the assumption either forces a placement you can accept or produces a contradiction that lets you eliminate the original candidate.
In plain terms: you temporarily assume a candidate is true, follow the rules of Sudoku through all forced consequences, and keep going until you can make a useful conclusion: either you prove some other cell must contain a number (placement) or you show the assumption is impossible (elimination). The forcing chain sudoku technique is just disciplined “what-if” reasoning that stays inside Sudoku logic.
When to look for a forcing chain
- When basic techniques (naked/hidden singles, pairs, pointing, box-line, simple X-wings) don’t make progress. A forcing chain is a next step before full-blown trial-and-error.
- When you have a small set of candidates for one digit that interact across rows/columns/blocks. Forcing chains work best when you can follow a clear sequence of strong and weak links rather than a web of many possibilities.
- When you need either a single decisive elimination (e.g., remove a candidate so a naked single appears) or you want to prove a digit must appear in a specific cell regardless of alternative placements.
A step-by-step example
Below is a compact candidate-grid focused on the digit 5. The diagram highlights a starting candidate and three linked consequences and ends by eliminating a candidate elsewhere. Follow the written steps after the diagram to see how the forcing chain works.
(See the accompanying candidate-grid visual.)
How to read the diagram
- The focus cell is the one we assume contains the digit 5.
- Related cells are the successive forced consequences — where placing 5 or removing 5 is forced by the previous step.
- The eliminated cell is the candidate that we prove cannot be 5 because it conflicts with the consequences of the assumption.
Walkthrough of the chain (using coordinates)
1. Assume r2c2 = 5 (focus). This is our premise; treat it as temporarily true and follow the consequences.
2. Because r2c2 is 5, 5 is removed from any other candidates in row 2 and the block containing r2c2. In our key cells this removes the possibility of 5 from r2c5, leaving r3c5 as the only remaining 5 in that column segment (a strong link). So r3c5 must be 5 (first forced placement).
3. With r3c5 = 5 forced, the 5 is removed from other candidates that share row 3 and column 5. One of those removals forces a 5 into r5c5 (next forced placement) because the other options in that column and block have been excluded by previous consequences.
4. Once r5c5 = 5 is fixed by the chain, that 5 clashes with the candidate 5 at r8c5 (same column). Because r5c5 is forced, r8c5 cannot be 5 — we have an elimination.
5. Since the chain started with r2c2 and ended by proving r8c5 cannot be 5, you can now remove 5 from r8c5 in the real puzzle. If that elimination creates a new single or pair, continue with basic techniques; if it leads to a contradiction earlier in the chain, you might instead eliminate r2c2.
Why this is useful
- One clean elimination can unblock entire sections of the grid by creating singles or enabling more straightforward logic. The forcing chain sudoku technique turns slow, accidental progress into deliberate breakthroughs.
- Forcing chains are non-destructive: you do not permanently change the grid until you reach a logical conclusion. You only assume, follow, and then apply the final proven elimination or placement.
Practical tips for everyday players
- Keep chains short at first. Chains of 3–6 steps are easier to follow and less error-prone. If you get lost, rewind and mark the key forced placements on a scratch grid.
- Track only one digit at a time. Most forcing chains are built around a single candidate value (like the 5 in the example) because links are digit-specific.
- Use strong and weak link language: a strong link exists when a digit can only go in two cells inside a house; choosing one forces the other to be false (and vice versa). A weak link is when many cells could hold the digit but two candidates cannot both be true simultaneously.
- Write short notes. Mark assumptions with a small symbol or color and mark forced placements. That makes it easier to see whether the assumption led to a contradiction.
- If both possible placements for a candidate in a cell (A and B) lead to the same conclusion elsewhere, that conclusion is true regardless — you’ve proved it without needing a full contradiction.
When to stop
Stop following a chain and apply its result as soon as you reach a logically valid placement or elimination you can accept without further branching. If the chain becomes tangled or requires exploring many alternative branches, try a different candidate or fall back to simpler patterns.
Summary
The forcing chain sudoku technique is a disciplined "what-if" that traces consequences from an assumed candidate. It’s most useful when standard methods stall but there are limited candidate options interacting across houses. Practice with small, clear chains and use the candidate-grid example above to get comfortable making and tracking assumptions before applying the proven elimination or placement to your puzzle.