SOLO-003 · Classic Sudoku
EXPERTThe Inverted Mesh
Complete the grid completely. Only one solution respects all constraints.
This page contains the solution.
The answer
345278916 / 791635824 / 862491537 / 529713468 / 673984152 / 184562379 / 218347695 / 937856241 / 456129783
| L / C | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 3 | 4 | 5 | 2 | 7 | 8 | 9 | 1 | 6 |
| 2 | 7 | 9 | 1 | 6 | 3 | 5 | 8 | 2 | 4 |
| 3 | 8 | 6 | 2 | 4 | 9 | 1 | 5 | 3 | 7 |
| 4 | 5 | 2 | 9 | 7 | 1 | 3 | 4 | 6 | 8 |
| 5 | 6 | 7 | 3 | 9 | 8 | 4 | 1 | 5 | 2 |
| 6 | 1 | 8 | 4 | 5 | 6 | 2 | 3 | 7 | 9 |
| 7 | 2 | 1 | 8 | 3 | 4 | 7 | 6 | 9 | 5 |
| 8 | 9 | 3 | 7 | 8 | 5 | 6 | 2 | 4 | 1 |
| 9 | 4 | 5 | 6 | 1 | 2 | 9 | 7 | 8 | 3 |
The reasoning
- Note the candidates in each box by crossing the line, column and region.
- In the certificate below, units 1 to 9 are lines, 10 to 18 columns, 19 to 27 regions. Units 28 and 29, if present, are diagonals.
- A nude subset of two or three cells reserves as many numbers: these figures are excluded from the other cells of the unit. An interaction limits one digit in the intersection of two units and excludes from the rest of the second.
- Each hypothesis opens a separate branch. Never keep in the neighbouring branch a value found under an abandoned hypothesis. The contradictions and all the figures deduced appear in the tree of evidence.
- The search finds exactly a complete grid. It runs through 3 states; the 1 contradictory branches are closed. Finally check each unit and each starting point.
Common mistakes and false leads
- Consolidate a temporary hypothesis with a demonstrated value.
- Use a subset of three boxes with four digits in the union.
- Forget a variant constraint or keep data from a refuted branch.
Show the full search proof
Each branch is independent. The tree records the deductions and contradictions found with the method used here.
- L2C2: only place for 9 in unit 2 → 9
- L3C9: only place for 7 in unit 3 → 7
- L5C5: only place for 8 in unit 5 → 8
- L6C9: only place for 9 in unit 6 → 9
- L5C4: only place for 9 in unit 5 → 9
- L5C2: only place for 7 in unit 5 → 7
- L4C4: only place for 7 in unit 4 → 7
- L5C9: only place for 2 in unit 5 → 2
- L4C2: only place for 2 in unit 4 → 2
- L4C1: only place for 5 in unit 4 → 5
- L6C7: only place for 3 in unit 6 → 3
- L4C6: only place for 3 in unit 4 → 3
- L7C8: only place for 9 in unit 7 → 9
- L7C4: only place for 3 in unit 7 → 3
- L8C3: only place for 7 in unit 8 → 7
- L9C5: only place for 2 in unit 14 → 2
- L9C4: only candidate → 1
- L8C9: only place for 1 in unit 8 → 1
- L8C5: only place for 5 in unit 14 → 5
- L9C6: only candidate → 9
- L8C6: only candidate → 6
- L7C5: only candidate → 4
- L7C3: only candidate → 8
- L7C7: only candidate → 6
- L5C7: only candidate → 1
- L4C7: only candidate → 4
- L4C8: only candidate → 6
- L4C5: only candidate → 1
- L5C1: only candidate → 6
- L6C5: only candidate → 6
- L3C2: only place for 6 in unit 3 → 6
- L8C1: only place for 9 in unit 8 → 9
- L9C8: only place for 8 in unit 9 → 8
- L9C2: only place for 5 in unit 9 → 5
- Nude subassembly in Unit 2: L2C4, L2C8, L2C9 reserve [2, 4, 6]; remove these figures from L2C3.
- Units 2 and 21 overlap. In unit 2, 4 must lie in the overlap. Remove it from L1C9.
L1C2 = 3
Assumption: L1C2 = 3
- L8C2: only candidate → 4
- L8C8: only candidate → 3
- L3C8: only candidate → 2
- L2C8: only candidate → 4
- L1C9: only candidate → 6
contradiction: a box no longer has no candidate
L1C2 = 4
Assumption: L1C2 = 4
- L8C2: only candidate → 3
- L8C8: only candidate → 4
- L2C8: only candidate → 2
- L2C4: only candidate → 6
- L1C4: only candidate → 2
- L1C3: only candidate → 5
- L1C6: only candidate → 8
- L1C1: only candidate → 3
- L1C9: only candidate → 6
- L2C3: only candidate → 1
- L2C6: only candidate → 5
- L2C7: only candidate → 8
- L2C9: only candidate → 4
- L3C1: only candidate → 8
- L3C3: only candidate → 2
- L3C6: only candidate → 1
- L3C7: only candidate → 5
- L3C8: only candidate → 3
- L6C3: only candidate → 4
- L6C1: only candidate → 1
- L9C1: only candidate → 4
- L9C9: only candidate → 3
valid complete solution
all the possibilities of this bifurcation have been examined
How we verified this answer
Exact enumeration, shutdown after two solutions, terminal verification of all units and cages.
{
"nodes": 3,
"branches": 1,
"contradictions": 1,
"depth": 1,
"pairs": 1,
"locked": 1
}After single candidates, single places, bare pairs/triples and interactions between units, the solver still reaches bifurcations. The exhaustive evidence reaches 1 intertwined hypotheses, examines 3 states and closes 1 branches by contradiction. The Expert level asks to keep a chain of possibilities in addition to the interactions. Editorial evaluation according to the protocol of the collection, without calibration on a panel of players; another logical path can be shorter.