Nishio Forcing Chain
A Nishio Forcing Chain is a contradiction-based chaining technique. You pick a cell with multiple candidates and assume one candidate is true, then propagate the implications through a dynamic binary chain — alternating strong and weak links on that candidate. If the chain reaches a contradiction (a cell that must be both true and false), the initial assumption was wrong and the candidate can be eliminated from the start cell. Unlike a Forcing X-Chain, Nishio uses dynamic binary chaining: it explores both true and false branches at each step, not just a single linear chain.
What is a Nishio Forcing Chain?
A Nishio Forcing Chain is a contradiction-based technique that uses dynamic binary chaining to test a single-candidate assumption. You select a cell with two or more candidates and assume one candidate is true. Then you propagate the implications through a binary chain: a strong link on the candidate means one of two cells must contain it, so if one is true the other is false; a weak link means at most one cell can contain it, so if one is true all others in that house are false. The chain is dynamic — it explores both branches (true and false) at each node, building a tree of implications rather than a single linear path. If any branch reaches a contradiction — a cell that must be both true and false for the candidate — the initial assumption was wrong, and the candidate can be eliminated from the start cell. Nishio is more powerful than a simple Forcing X-Chain because the dynamic branching explores more implications, but it is also more computationally expensive. The technique is named after Nishio Susumu, a Japanese Sudoku pioneer.
How to spot it
To find a Nishio Forcing Chain, look for a cell with multiple candidates where assuming one candidate true (or false) creates a rich network of strong and weak links on that digit. Start by scanning for cells that participate in strong links — houses where the candidate is confined to exactly two cells. Pick a cell, assume the candidate is true, and propagate: the strong link forces the other cell false; from that false cell, check if it is part of another strong link (forcing the paired cell true), or if it creates a weak-link elimination in its house. Continue branching — at each node, explore both the true and false implications. If any branch leads to a cell that must be both true and false, you have a contradiction and the candidate can be eliminated from the start cell. Nishio is best attempted when simpler techniques (Forcing X-Chains, Forcing Chains) have been exhausted, as the dynamic branching is computationally intensive.
The logic
A Nishio Forcing Chain works by dynamic binary chaining on a single candidate. Assume candidate C is true in the start cell. A strong link on C in a house means one of two cells must contain C: if the start cell is true, the other cell in the strong link is false. From that false cell, a weak link on C in its house forces C false in all other cells of that house. If one of those false cells is part of another strong link, the paired cell must be true. The chain branches dynamically: at each node, both the true and false implications are explored, building a tree rather than a single path. If any branch reaches a cell that must be both true and false for C — a contradiction — the initial assumption (C is true in the start cell) was wrong, and C can be eliminated from the start cell. The logic is a direct application of strong-link and weak-link semantics, extended with dynamic branching to explore more implications than a linear chain. Nishio is a single-candidate technique: the entire chain operates on one digit, and the contradiction proves that digit cannot go in the start cell.