Forcing Chain
A Forcing Chain starts from one explicit candidate assumption and follows only forced consequences. If the assumption creates a contradiction, that assumption is false.
What is a Forcing Chain?
A true candidate makes every weakly linked candidate false. A false candidate makes the other side of a strong inference true. False on one side of a weak inference alone proves nothing. A branch choice that is not forced cannot be treated as a consequence. The final contradiction must occur in the state created by the original assumption.
Walkthrough example
A walkthrough of one Forcing Chain: a single candidate assumption is followed through forced implications to a contradiction.
Step 1
Consider these cells.
Step 2
Through a chain of implications, it can be shown that B1 must contain the value 1. 1. If B1 does not contain the value 1, then B1 must contain the value 2 (only remaining possible value in the cell) 2. If B1 contains the value 2, then A1 cannot contain the value 2 (the value can occur only once in the block) 3. If A1 does not contain the value 2, then A1 must contain the value 3 (only remaining possible value in the cell) 4. If A1 contains the value 3, then A8 cannot contain the value 3 (the value can occur only once in the column) 5. If A8 does not contain the value 3, then A8 must contain the value 9 (only remaining possible value in the cell) 6. If A8 contains the value 9, then A7 cannot contain the value 9 (the value can occur only once in the block) 7. If A7 does not contain the value 9, then D7 must contain the value 9 (only remaining possible position in the row) 8. If D7 contains the value 9, then D7 cannot contain the value 1 (the cell can contain only one value) 9. If D7 does not contain the value 1, then D9 must contain the value 1 (only remaining possible position in the block) 10. If D9 contains the value 1, then D9 cannot contain the value 4 (the cell can contain only one value) 11. If D9 does not contain the value 4, then F9 must contain the value 4 (only remaining possible position in the block) 12. If F9 contains the value 4, then F1 cannot contain the value 4 (the value can occur only once in the column) 13. If F1 does not contain the value 4, then F1 must contain the value 2 (only remaining possible value in the cell) 14. If F1 contains the value 2, then B1 cannot contain the value 2 (the value can occur only once in the row) 15. If B1 does not contain the value 2, then B1 must contain the value 1 (only remaining possible value in the cell)
Step 3
So value 2 can be removed from B1: the chain proves that B1 must contain 1, so no other value can go there.
This walkthrough shows one valid example of the defined deduction. Confirm the stated source set or assumption, that every branch was tested, and that the applied conclusion is shared by all of them before using the same deduction on another grid. You can play sudoku online to practise with the current candidate state visible.
How to spot it
State the source proposition or exhaustive source set, then annotate every step with its reason. Continue until the assumption forces an empty cell, a digit with no house position, or both a proposition and its negation.
The logic
If assumption A implies a contradiction, A is false; if assumption not-A implies a contradiction, A is true. Optional branches must remain alternatives rather than being reported as forced links.