Forcing Chains in Sudoku: A Complete Guide to This Expert-Level Logic

By Michel 22 March 2026

Forcing chains are one of the most powerful techniques available to expert Sudoku solvers. They sit at the boundary between pure logic and what many people mistake for guessing — but they are not guessing. A forcing chain follows a sequence of inescapable conclusions from a starting assumption, and uses those conclusions to make eliminations that are guaranteed regardless of which starting assumption turns out to be correct. This guide explains what forcing chains are, the three main types, how to apply them, and how they compare to the related technique of nice loops.

What Are Forcing Chains in Sudoku?

A forcing chain is a logical technique that works by temporarily assuming a candidate is either true or false, then following the consequences of that assumption step by step through the grid. The key insight is this: if every possible starting assumption leads to the same conclusion somewhere else in the grid, that conclusion must be true — regardless of which assumption is actually correct.

In other words, you do not need to know which assumption is right. You only need to prove that all possibilities force the same result. That result is then a safe, logic-backed deduction, not a guess.

Forcing chains require careful pencil marks and systematic tracking. They are typically reserved for Expert and Master grids where all simpler techniques — singles, locked candidates, pairs, triples, fish patterns — have been exhausted. For a reference on the underlying rules, see the Forcing Chains strategy page.

Types of Forcing Chains (Cell, Unit, Nishio)

There are three main variants of forcing chains. They differ in what the starting assumption is about:

Cell Forcing Chains

A cell forcing chain starts from a single cell that has exactly two candidates — say, digits 4 and 7. You assume 4 is correct and follow the chain of consequences. Then you assume 7 is correct and follow that chain instead. If both chains lead to the same conclusion (for example, that a particular cell in row 6 cannot contain 3), that elimination is valid. The technique exploits the fact that one of the two candidates must be right, so any result they share is guaranteed.

Unit Forcing Chains

A unit forcing chain works across all remaining positions of a digit within a row, column, or box. Suppose digit 5 can only go in three cells in a given column. You assume 5 is in the first cell and trace the consequences; then assume 5 is in the second cell; then the third. If all three chains produce the same result elsewhere in the grid, that result is a valid deduction. This variant is more complex to execute than a cell forcing chain because you may need to trace three or more branches instead of two.

Nishio (Contradiction) Forcing Chains

A Nishio chain, named after Tetsuya Nishio, works by assuming a candidate is true and following the consequences until a logical contradiction emerges — a row, column, or box that has no place left for a required digit. When the assumption leads to a dead end, the assumption must be wrong, so you can eliminate that candidate from the starting cell. Unlike standard forcing chains, Nishio requires only one branch rather than two or more — but it does require you to spot a contradiction, which demands careful tracking of all propagated constraints.

How Forcing Chains Work — Step-by-Step

Here is a worked approach for a cell forcing chain using a two-candidate cell:

Identify a bi-value cell. Find a cell with exactly two candidates, for example {3, 8} in row 2, column 5. These are your two starting assumptions.
Trace Assumption A. Assume the cell holds 3. Apply the immediate consequences: does placing 3 here eliminate a candidate from another cell? Does that reduction force a placement somewhere? Follow each forced step — naked singles, hidden singles, locked candidates — until the chain runs out of forced moves. Note every cell and candidate affected.
Trace Assumption B. Reset to the original state and assume the cell holds 8 instead. Follow the same process, tracking every consequence.
Compare the results. Look for any candidate that is eliminated in both chains, or any placement that is made in both chains. Any result that appears in both is a safe deduction you can apply to the actual puzzle right now.
Apply the shared conclusions and continue solving. After recording the shared eliminations or placements, apply them and re-scan the grid. The new state may unlock simpler techniques like naked singles or pointing pairs.

Tracking the chain clearly on paper or with pencil marks is essential. Many solvers use a notation like "If R2C5=3 → R4C5≠3 → R4C5=7 → …" to keep the logic visible and auditable.

Forcing Chains vs Nice Loops: Key Differences

Forcing chains and nice loops are closely related, and the boundary between them can be blurry. The key distinctions are:

Nice loops form a closed cycle. A nice loop traces a chain of alternating strong and weak links — strong links where exactly one of two candidates must be true, weak links where at least one must be false — and returns to the starting point, creating a loop. Eliminations fall out of the loop structure itself.
Forcing chains branch from a starting assumption. A forcing chain does not need to return to its origin. Instead, it fans out from a starting assumption until it reaches a contradiction (Nishio) or until two branches converge on a shared conclusion.
Nice loops are traceable as patterns. Because they use strict alternating link logic, nice loops can be represented diagrammatically and are easier to verify. Forcing chains are more open-ended and can be harder to check for errors.
Forcing chains are generally more powerful. They can make eliminations that nice loops cannot, at the cost of being more complex to construct. In practice, try nice loops first — if you find one, it is cleaner. If not, forcing chains provide a more flexible option.

Both techniques connect to the broader family of simple coloring, which assigns labels to candidate cells based on strong links and is an accessible entry point before tackling full forcing chain logic.

When Forcing Chains Are Necessary

Forcing chains appear on the hardest Sudoku grids — typically rated Expert or above. They become necessary when:

All naked and hidden singles have been exhausted.
Locked candidates, naked pairs, and hidden pairs yield no more eliminations.
Fish patterns (X-Wing, Swordfish, Jellyfish) and wing techniques (XY-Wing, XYZ-Wing) produce nothing further.
The grid is still unsolved with many bi-value cells and bilocal candidates remaining.

A good heuristic: before attempting forcing chains, always verify that you have genuinely exhausted simpler techniques. Forcing chains take significant effort, and a missed naked pair or hidden triple often provides a faster path. Once you are confident that simpler techniques are exhausted, a cell forcing chain starting from any bi-value cell is a reliable first attempt.

Is Forcing Chains Considered Guessing?

No — and this is the most common misconception about forcing chains. The confusion arises because the technique involves temporarily assuming a candidate is true or false, which sounds like guessing. But guessing means committing to an assumption without knowing it is correct and hoping for the best. Forcing chains are different in a crucial way: you never commit to either assumption.

Instead, you observe what both assumptions imply, then act only on the conclusions that hold regardless of which assumption is correct. The logic is deductive, not speculative. It is analogous to a proof by contradiction or a proof by cases in mathematics — both are considered rigorous reasoning, not guesswork.

The only technique that arguably crosses into guessing territory is trial and error, where you commit to a candidate placement, continue solving the entire puzzle, and backtrack if you hit a contradiction. Forcing chains avoid this: they are always bounded, always reversible, and always derive safe conclusions from the joint structure of both branches.

If you want to solve every puzzle with pure logic, forcing chains are a legitimate and necessary tool for the hardest grids. Ready to test your skills? Try today's daily Sudoku and see how far you can get before the chains become necessary.