Forcing

Is It Guessing? The Forcing Chains Controversy

No. Forcing chains explore every possibility simultaneously without committing to any assumption. They compare all branches and only act when branches converge. Three distinguishing properties: exhaustive exploration, deterministic conclusion, and provable correctness. Forcing chains are less elegant than pattern-based techniques but are provably correct.

Cell Forcing Chain

Start from a bivalue cell {A, B}. Propagate implications for each branch. Compare results. Contradiction: one branch is invalid, so the cell must be the other candidate. Convergence on placement: both branches force the same digit into the same distant cell. Convergence on elimination: both branches eliminate the same candidate from the same cell.

Region Forcing Chain (Digit Forcing Chain)

Start from a digit's 2-3 positions in a house. Explore each position as a branch. Same three deduction types. Cell forcing is effective when bivalue cells have far-reaching implications. Region forcing is effective when a digit's position has strong cascading effects.

Forcing Net: Extending the Branch Count

Cell Forcing Net: cells with 3-6 candidates. Region Forcing Net: houses with 4-6 positions for a digit. More branches, more expensive, but can find deductions Forcing Chains cannot. The logic is identical. Only the branch count differs.

The Propagation Engine

Each branch propagates through naked singles, hidden singles, locked candidates, and naked pairs, iteratively until stable. A single assumption can ripple through dozens of intermediate steps across the entire board. When two branches reach the same conclusion through completely different paths, the convergence proves the conclusion with certainty.

The Three Deduction Types

Contradiction: A branch produces an invalid state. That assumption is false. Most common. Convergence on Placement: All branches force the same digit into the same cell. Less common but decisive. Convergence on Elimination: All branches eliminate the same candidate from the same cell. Subtlest type.

When to Use Forcing Techniques

Last logical resort. Applied after all other techniques fail. Forcing Chains (2-3 branches) is tried first. Forcing Net (3-6 branches) only when Chains fails. Both are Level 12 (Extreme). For computer solvers, forcing provides completeness: the guarantee that logic alone can solve any valid puzzle.

A Philosophical Note on Elegance and Completeness

Pattern-based techniques reveal structural relationships and are more elegant. But there exist valid puzzles that require forcing-level logic. Forcing techniques are the safety net that catches every puzzle pattern-based techniques cannot handle. The most satisfying approach: try every pattern-based technique first, then resort to forcing only when the puzzle genuinely demands it.

Summary

Forcing chains and forcing net are the most powerful logical techniques, at Level 12 (Extreme). They explore every possibility from a starting point, propagate consequences, and compare results. Deductions come through contradiction, convergence on placement, or convergence on elimination. They are the last resort before brute-force backtracking, providing completeness for any valid Sudoku puzzle.