Contradiction Forcing
Assume a candidate is true and follow the forced steps. A conflict proves the candidate wrong.
key digits removed
Why it works
When no direct technique applies, you can test a candidate. Place it as a hypothesis, then make only forced moves: last cell in a run, one candidate left, a run that has no partition at all.
If the hypothesis leads to a run that cannot be filled, a digit that has to go twice, or a sum that cannot be reached, the hypothesis was false. The candidate is removed. If every other digit has been removed, the last one is the answer.
The app proves this for you in the "Why not?" panel. It shows the assumption, the digits it forces and the exact conflict, so you can check every link of the argument.
How to spot it
- Pick a cell with two or three candidates and choose one.
- Place it and follow only forced moves.
- If you reach a conflict, remove the candidate.
- If there is no conflict and the puzzle still solves, the candidate is possible, but it is not proven correct.
Practice it
Open the app, choose a level that uses this technique, and ask the coach for the next step. Every hint links back to this guide.