PaulIQ164 wrote:What I'm not sure about, is whether you can get a 2-solutioned puzzle, use this technique (incorrectly, since it's the 'uniqueness' technique, and you don't have a unique solution to exploit) and end up in a position where you have no solutions.
Here is an example of this.
Consider this grid:
- Code: Select all
5 6 2 3 8 9 4 7 1
8 4 9 7 1 6 2 5 3
1 3 7 4 2 5 8 9 6
3 5 8 1 9 4 6 2 7
9 7 4 2 6 3 1 8 5
2 1 6 8 5 7 3 4 9
6 9 1 5 4 2 7 3 8
7 2 5 6 3 8 9 1 4
4 8 3 9 7 1 5 6 2
Remove the digits in all the cells with 8 and 9, and one further cell (r1c1). Now consider what is left as a puzzle:
- Code: Select all
. 6 2 3 . . 4 7 1
. 4 . 7 1 6 2 5 3
1 3 7 4 2 5 . . 6
3 5 . 1 . 4 6 2 7
. 7 4 2 6 3 1 . 5
2 1 6 . 5 7 3 4 .
6 . 1 5 4 2 7 3 .
7 2 5 6 3 . . 1 4
4 . 3 . 7 1 5 6 2
If you use the uniqueness rule, then you argue that 5 cannot go in r1c1, because if it did the puzzle has two solutions. But 5 cannot go in any other cell, because you either get two 5s in a row or a column. So the uniqueness rule implies no solution. Not using the uniqueness rule there are two solutions.
Edit: The puzzle was wrong when I first posted it, it got mangled somehow. It's now corrected, sorry.