Can someone help me with this one?
I can solve it bridging, but can't find the logical solution.
It is a hard problem and comes from Pappacom's computer program, and will verify
[code]
2349 29 2459 1359 7 1359 8 6 259
7 1 59 68 68 2 3 4 59
239 6 8 359 4 359 15 179 2579
6 3 7 2589 2589 589 15 189 4
249 289 1 35789 589 345789 6 389 3589
5 89 49 13689 689 134689 7 2 389
1 7 29 289 3 89 4 5 6
289 5 3 4 269 679 29 78 1
289 4 6 2579 1 579 29 378 378
[code]
Here is the startiing grid:
. . . . 7 . 8 6 .
7 . . . . 2 3 . .
. 6 8 . 4 . . . .
. 3 7 . . . . . 4
. . 1 . . . 6 . .
5 . . . . . 7 2
. . . . 3 . 4 5 .
. . 3 4 . . . . 1
. 4 6 . 1 . . . .
[/code]
There are no "9s" in the starting grid.
I am looking for the logical next step with an eplanation of the solution strategy