Nested proofs and search
Difficulty Impossible foundationA conclusion reached inside a trial depends on the assumption that led there. A nested proof tries another choice inside that trial. Its conclusion applies to the original grid only after the outer cases support it.
Keep the inner and outer choices separate
Suppose one starting choice is true. If the resulting grid still has two ways forward, test those choices separately within that case.
Keep each conclusion in its scope
Suppose the outer choice is A. Inside A, both possible values of B force C. You can now use C to continue the A case.
To use C on the original grid, every remaining outer case must also force C. Alternatively, a contradiction in A rules out A itself.
A trial inside another trial
Each arrow stands for a sequence of moves. Read the inner branches before returning to the outer choice.
- Assume A is true
- B is true, inside A
A proved deduction leads to C.
- B is false, inside A
A proved deduction also leads to C.
C is true under A.
- A is false
Not checked. C is still unknown in this branch.
Keep the outer assumption
Suppose A is true. Whether B is true or false, C follows. You can use C in the A branch.
| Result | Conclusion |
|---|---|
| One valid completed grid | At least one solution exists. |
| A second distinct valid grid | The puzzle is not unique. |
| Every branch under A fails | A is impossible. |
| The search reaches a time limit | The search is unfinished. |
Computer methods and human proofs
A solver can test a choice, follow its consequences, and return to the last choice if it fails. This is backtracking. Another approach compares complete layouts for one or more digits.
Impossible is the highest difficulty in the app. A player can still find a shorter proof than the solver found.