- Code: Select all
. 3 . | . . . | 7 4 .
. . . | . . . | 9 8 .
. . . | 4 8 5 | 6 2 .
------+-------+------
2 . . | . . 9 | . . .
. 6 . | 1 . 4 | . 3 .
. . . | 8 . . | . . 9
------+-------+------
. 9 6 | 7 3 1 | . . .
. 2 . | . . . | . . .
. 1 7 | . . . | . 6 .
This is what I have so far:
- Code: Select all
568 3 258 | 269 1269 26 | 7 4 15
456 45 245 | 236 1267 2367 | 9 8 15
19 7 19 | 4 8 5 | 6 2 3
------------------+--------------------+-------------------
2 8 1345 | 35 57 9 | 45 17 6
579 6 59 | 1 257 4 | 258 3 28
13457 45 1345 | 8 2567 2367 | 245 17 9
------------------+--------------------+-------------------
48 9 6 | 7 3 1 | 28 5 248
3458 2 3458 | 56 456 68 | 1 9 7
458 1 7 | 259 2459 28 | 3 6 48
I have tried locked candidates, disjoint subsets, all the "basic methods", and I can't seem to get any further. Since this is a publication puzzle, I wouldn't think it would require any of that more advanced analysis... any help?