⛓️ Forcing Chains

Forcing Chains are the expert solver's ultimate tool. When every pattern-based technique — Naked Singles, Hidden Singles, Naked Pairs, X-Wing, Swordfish — has been exhausted and the puzzle still refuses to yield, forcing chains cut through by reasoning: "if this cell has value A, then the following must be true…" The technique is more powerful than anything based purely on visual patterns, because it models the consequences of a candidate rather than just its position.

The core idea

A forcing chain starts from a bivalue cell — a cell with exactly two candidates, say {4, 9}. Since one of those two values must be correct, you reason about both possibilities:

  • Assume the cell contains 4. Trace all logical consequences: which other cells become forced? Which candidates are eliminated? Continue until no more deductions follow.
  • Assume the cell contains 9. Trace all logical consequences independently, starting fresh.

Two useful conclusions can follow from this analysis:

  1. One assumption leads to a contradiction — two cells in the same unit are both forced to the same value, or some cell is forced to have no candidates at all. That assumption is wrong. The other value is correct. Place it.
  2. Both assumptions independently force the same value in some other cell. That value must be correct regardless of which assumption holds. Place it immediately.

Step-by-step guide

  1. Complete all candidate pencil marks. Forcing chains rely on knowing all candidates for every empty cell. Any missing candidates will produce incorrect conclusions.
  2. Find a bivalue cell — a cell with exactly two candidates {X, Y}. These are the most efficient chain starting points because they have the fewest branches.
  3. Start chain A: assume the cell contains X.
    • If a unit now has only one candidate for some digit, that digit is forced there. Record the placement.
    • Continue cascading: each forced placement may force others via Naked Singles or Hidden Singles.
    • Stop when nothing more is forced or you encounter a contradiction.
  4. Start chain B: assume the cell contains Y. Repeat the same process independently, ignoring everything you discovered in chain A.
  5. Analyse the results:
    • If chain A contradicts → cell must contain Y. Place Y and continue solving normally.
    • If chain B contradicts → cell must contain X. Place X and continue solving normally.
    • If both chains force the same value in some other cell → place that value regardless of which chain is correct.
  6. After any placement, check for new Naked Singles and Hidden Singles before extending another chain.
Bivalue cell { 4 , 9 } if = 4 if = 9 B=7 → C=3 → D=7 D already 7! Contradiction ✗ E=2 → F=8 → G=5 No contradiction ✓ Cell must be 9 assumption 4 leads to contradiction

Assuming 4 leads to a contradiction (D forced to 7 twice) — therefore the cell must contain 9

Strong links and weak links

Forcing chains are described more precisely using the language of links:

  • Strong link: A digit appears in exactly two cells in a unit. If the digit is NOT in cell A, it MUST be in cell B. This is the engine of the chain — it propagates certainty forward.
  • Weak link: A digit appears in two or more cells in a unit. If the digit IS in cell A, it CANNOT be in cell B. This is the elimination step.

A well-formed forcing chain alternates strong and weak links: strong → weak → strong → weak → … This is called an Alternating Inference Chain (AIC), the mathematical foundation of all advanced Sudoku solving theory. Bivalue cells provide the simplest strong links: if a cell has exactly {X, Y}, it is either X or Y — a strong link between X and Y within that cell.

Simple Colouring

Simple Colouring is the most approachable form of chain reasoning and a natural stepping stone to full forcing chains:

  1. Pick a digit and find all strong links — units where that digit appears in exactly two cells.
  2. Colour one end of each strong link blue and the other green. Propagate: if a cell is blue, its strong-link partner is green, and vice versa. Continue until no more propagations are possible.
  3. If two cells of the same colour appear in the same unit, that colour is wrong — eliminate the digit from all cells of that colour.
  4. If an uncoloured cell can see (shares a unit with) both a blue cell and a green cell, eliminate the digit from that uncoloured cell — regardless of which colour is correct, this cell cannot hold the digit.

When to use Forcing Chains

Forcing Chains should always be a last resort. Before reaching for them, ensure you have exhausted:

  1. Naked Singles and Hidden Singles
  2. Naked Pairs and Hidden Pairs
  3. Naked Triples
  4. X-Wing and Swordfish
  5. Simple Colouring

If all the above fail, a Forcing Chain will crack virtually any Evil-difficulty Sudoku. In competitive solving, the hierarchy above is applied strictly — using a sledgehammer when a tap would do wastes time and mental energy.

Practical tips for SudokuStreak

  • On Evil difficulty, expect to use at least one Forcing Chain. The puzzle is specifically designed so that pattern-based techniques run out before the puzzle is solved.
  • Start from bivalue cells. They have the simplest chains — only two branches. A cell with three candidates requires three separate branches, which is far harder to manage.
  • Keep chains short. If your chain has more than 8–10 steps without a conclusion, there is almost certainly a simpler technique you have missed. Pause and re-scan for Hidden Singles or X-Wings before continuing.
  • Write it down. Track your chain assumptions on paper or in a note. It is very easy to lose track of forced placements after 5 or more steps.
  • Use the Hint button. In SudokuStreak, the Hint uses computer-strength solving and will always find the optimal next move — including identifying when a Forcing Chain is needed and suggesting where to start.

Common mistakes

  • Skipping the cascade. After assuming a value, keep tracing all forced placements — Naked Singles and Hidden Singles that arise from your assumption are part of the chain. Stopping too early misses contradictions or conclusions.
  • Contaminating chains. If you are testing assumption A, do not mix in deductions from assumption B. Keep the two chains completely separate until the analysis step at the end.
  • Assuming more than one cell. Forcing Chains work from a single bivalue cell assumption. If you find yourself needing to assume the values of two cells simultaneously, you are doing Bifurcation (trial-and-error), which is outside the domain of pure logic-based solving.
  • Ignoring simpler possibilities. Fresh eyes on the board after a break often spot a Hidden Single or Naked Pair that was missed in frustration. Always do one final scan of all units before starting a chain.