Forcing Chains in Sudoku: A Practical Introduction

The difference between a chain and a guess

Guessing means choosing a candidate because it seems likely and continuing without proving the choice. A forcing chain is structured. You begin with a cell or candidate that has a small number of possible states, follow the consequences of each state, and look for a result that occurs in every branch. Because all possibilities agree on that result, it is certain even though the starting choice remains unresolved. This method is sometimes called bifurcation when there are two branches. Used carefully, it is a logical technique, not trial and error. The difference is accountability. Every step in a chain must follow from a Sudoku rule, and every possible starting state must be considered. If you explore only the branch you prefer, you have returned to guessing. The proof comes from comparing complete alternatives.

Choose a useful starting point

The best starting points are highly constrained. A bivalue cell gives two clean branches: candidate A is true or candidate B is true. A conjugate pair for one shape in a unit also gives two positions to test. Avoid starting from a cell with five candidates, because the branches multiply and become difficult to track. In Shapedoku, write down or mentally label the two possibilities before following them. The goal is not to solve an entire imaginary puzzle. It is to trace a short sequence of forced singles and eliminations until the branches meet at a common consequence. Keep branches short by choosing starts near crowded units or other bivalue cells. A branch that immediately creates a single is easier to follow than one that merely removes a candidate from a flexible cell. Notes, screenshots, or temporary color marks can help keep the two paths separate.

Look for three kinds of conclusion

The strongest result is a contradiction. If one branch produces a duplicate shape, an empty cell with no candidates, or a unit with no position for a required shape, that branch is false and the other branch is true. A second result is a common placement: both branches may force the same candidate somewhere else, making that placement certain. A third result is a common elimination: both branches may remove the same candidate from an outside cell. Stop as soon as you find one of these conclusions. Long chains are harder to verify and more likely to contain a tracking error. A chain may also end without a useful shared result. That is fine. Erase the temporary reasoning and choose another starting point. Forcing chains are powerful, but they should not replace simpler scans. Check singles, locked candidates, pairs, and fish first, since those deductions are easier to verify and explain.

1. Select a bivalue cell or a two-position candidate in one unit.
2. Follow the first possibility using only forced consequences.
3. Return to the start and follow the second possibility separately.
4. Compare the branches for a shared placement, shared elimination, or contradiction.
5. Apply only the conclusion that is guaranteed across all branches.
6. Recheck the chain if any step depended on an uncertain candidate note.