SOLO-007 · Irregular Sudoku
EXPERTThe Living Border
Complete the grid completely. Only one solution respects all constraints.
This page contains the solution.
The answer
564912378 / 783694125 / 128537946 / 215873469 / 379465281 / 496281537 / 637149852 / 942758613 / 851326794
| L / C | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 5 | 6 | 4 | 9 | 1 | 2 | 3 | 7 | 8 |
| 2 | 7 | 8 | 3 | 6 | 9 | 4 | 1 | 2 | 5 |
| 3 | 1 | 2 | 8 | 5 | 3 | 7 | 9 | 4 | 6 |
| 4 | 2 | 1 | 5 | 8 | 7 | 3 | 4 | 6 | 9 |
| 5 | 3 | 7 | 9 | 4 | 6 | 5 | 2 | 8 | 1 |
| 6 | 4 | 9 | 6 | 2 | 8 | 1 | 5 | 3 | 7 |
| 7 | 6 | 3 | 7 | 1 | 4 | 9 | 8 | 5 | 2 |
| 8 | 9 | 4 | 2 | 7 | 5 | 8 | 6 | 1 | 3 |
| 9 | 8 | 5 | 1 | 3 | 2 | 6 | 7 | 9 | 4 |
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.
- L1C6: only place for 2 in unit 1 → 2
- L2C8: only place for 2 in unit 2 → 2
- L7C7: only place for 8 in unit 16 → 8
- L3C3: only place for 8 in unit 12 → 8
- L2C4: only candidate → 6
- L3C4: only candidate → 5
- Units 1 and 21 overlap. In unit 1, 3 must lie in the overlap. Remove it from L4C7.
- Units 5 and 23 overlap. In unit 5, 4 must lie in the overlap. Remove it from L4C5.
- Units 5 and 23 overlap. In unit 5, 5 must lie in the overlap. Remove it from L6C5, L6C6.
- Units 6 and 23 overlap. In unit 6, 2 must lie in the overlap. Remove it from L4C5.
- Units 4 and 22 overlap. In unit 4, 2 must lie in the overlap. Remove it from L7C1.
- Units 8 and 27 overlap. In unit 8, 6 must lie in the overlap. Remove it from L7C8, L7C9.
- L7C1: only place for 6 in unit 7 → 6
- L1C2: only place for 6 in unit 11 → 6
- L1C1: only place for 5 in unit 1 → 5
- L1C3: only place for 4 in unit 19 → 4
- Nude subset in Unit 21: L1C7, L1C8 reserve [3, 7]; remove these numbers from L2C7, L3C7, L3C9, L4C7.
- Units 11 and 25 overlap. In unit 11, 4 must lie in the overlap. Remove it from L7C4.
- L5C4: only place for 4 in unit 13 → 4
- Units 14 and 23 overlap. In unit 14, 8 must lie in the overlap. Remove it from L6C4.
- L4C4: only place for 8 in unit 13 → 8
- L4C1: only place for 2 in unit 4 → 2
- L6C5: only place for 8 in unit 6 → 8
- L6C4: only place for 2 in unit 6 → 2
- Units 9 and 26 overlap. In unit 9, 2 must lie in the overlap. Remove it from L7C5, L8C5.
- L9C5: only place for 2 in unit 14 → 2
- Units 17 and 27 overlap. In unit 17, 9 must lie in the overlap. Remove it from L9C7.
- Units 23 and 15 overlap. In unit 23, 3 must lie in the overlap. Remove it from L7C6.
- L9C4: only place for 3 in unit 26 → 3
- L7C4: only candidate → 1
- L8C3: only candidate → 2
- L7C3: only candidate → 7
- L9C1: only candidate → 8
- L9C2: only candidate → 5
- L2C2: only place for 8 in unit 2 → 8
- L7C9: only place for 2 in unit 7 → 2
- L5C1: only place for 3 in unit 10 → 3
- L9C3: only place for 1 in unit 26 → 1
- L5C3: only candidate → 9
- L9C7: only candidate → 7
- L1C7: only candidate → 3
- L1C8: only candidate → 7
- L9C8: only candidate → 9
- L6C2: only place for 9 in unit 6 → 9
L2C1 = 1
Assumption: L2C1 = 1
- L2C7: only candidate → 9
- L2C5: only candidate → 7
- L3C1: only candidate → 7
- L3C6: only candidate → 9
- L4C5: only candidate → 6
- L5C5: only candidate → 5
- L7C6: only candidate → 5
- L7C8: only candidate → 3
- L7C2: only candidate → 4
- L7C5: only candidate → 9
- L8C2: only candidate → 3
- L8C5: only candidate → 4
- L4C6: only place for 3 in unit 4 → 3
- L4C2: only place for 7 in unit 4 → 7
- L5C2: only candidate → 1
- L5C6: only candidate → 7
- L5C9: only candidate → 6
- L3C9: only candidate → 1
contradiction: a box no longer has no candidate
L2C1 = 7
Assumption: L2C1 = 7
- L2C5: only candidate → 9
- L2C7: only candidate → 1
- L3C1: only candidate → 1
- L3C6: only candidate → 7
- L3C9: only candidate → 6
- L3C8: only candidate → 4
- L3C7: only candidate → 9
- L4C7: only candidate → 4
- L6C7: only candidate → 5
- L8C7: only candidate → 6
- L5C5: only place for 6 in unit 5 → 6
- L4C5: only candidate → 7
- L4C2: only candidate → 1
- L4C6: only candidate → 3
- L4C8: only candidate → 6
- L5C2: only candidate → 7
- L5C9: only candidate → 1
- L5C6: only candidate → 5
- L6C6: only candidate → 1
- L6C8: only candidate → 3
- L6C9: only candidate → 7
- L7C6: only candidate → 9
- L7C8: only candidate → 5
- L7C5: only candidate → 4
- L7C2: only candidate → 3
- L8C2: only candidate → 4
- L8C5: only candidate → 5
- L8C8: only candidate → 1
- L8C9: 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": 11
}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.