Dynamic Forcing Chain
A Dynamic Forcing Chain starts from one explicit assumption and applies every forced consequence to a temporary candidate state. New singles or other deductions created in that state may extend the chain. Every intermediate result remains conditional on the starting assumption until the proof reaches and discharges a contradiction or exhaustive conclusion.
What is a Dynamic Forcing Chain?
Dynamic means later inferences may rely on candidates removed earlier under the same assumption. Removing one candidate from a bivalue cell leaves a single; removing its final candidate creates a contradiction. The temporary state must not be confused with the original grid.
Walkthrough example
A walkthrough of one Dynamic Forcing Chain: forced consequences are applied to a temporary candidate state, letting new singles extend the branch until it discharges.
Step 1
Consider these cells.
Step 2
Assume A1 must contain the value 7. The contradiction rejects that assumption; the chains below show why. This dynamic Forcing Chain uses dynamic grid mutation (candidates are removed during chain exploration) to prove that A1 cannot contain the value 7. Chain 1: 1. If A1 contains the value 7, then A9 cannot contain the value 7 (the value can occur only once in the column) 2. If A9 does not contain the value 7, then A9 must contain the value 5 (only remaining possible value in the cell) 3. If A9 contains the value 5, then A7 cannot contain the value 5 (the value can occur only once in the block) 4. If A7 does not contain the value 5, then A7 must contain the value 9 (only remaining possible value in the cell). Chain 2: 1. If A1 contains the value 7, then C3 cannot contain the value 7 (the value can occur only once in the block) 2. If C3 does not contain the value 7, then C4 must contain the value 7 (only remaining possible position in the column) 3. If C4 contains the value 7, then C4 cannot contain the value 9 (the cell can contain only one value) 4. If C4 does not contain the value 9, then A4 must contain the value 9 (only remaining possible position in the block) 5. If A4 contains the value 9, then A7 cannot contain the value 9 (the value can occur only once in the column).
Step 3
So A1 7 can be removed: the dynamic forcing chain proves that A1 cannot contain the value 7.
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
Record the starting assumption, then annotate each consequence with the current assumed state. Use a deduction only when its premises are already forced in that state. Stop when the assumption creates a contradiction or when all exhaustive alternatives establish the same target conclusion.
The logic
A Dynamic Forcing Chain keeps one temporary state for its starting assumption. Removing one candidate from a bivalue cell leaves its other candidate as a naked single; removing the final candidate from a cell is instead a contradiction. Every new single, locked candidate, subset, fish, or wing used later must be valid in that same temporary state. If the state reaches a contradiction, the starting assumption is false. Otherwise a conclusion can be transferred to the original grid only after the assumption has been discharged or every exhaustive branch has established it.