I wondered whether puzzles exist where the symmetry means s(i, j) = s(10-i, 10-j). (Perhaps this has been discussed in the distant past, but I can't find any references.) The puzzle below is a near miss: without the added clue it would have six solutions.
- Code: Select all
. . . . . 6 . . 1
6 . 1 8 . . . . 5
. 5 . . . 3 . 4 9
2 . . . . . 7 . 3
. . . . . . . . .
3[6]7 . . . . . 2
9 4 . 3 . . . 5 .
5 . . . . 8 1 . 6
1 . . 6 . . . . . hard
.....6..16.18....5.5...3.492.....7.3.........367.....294.3...5.5....81.61..6.....
No. of givens = 27, minimal, givens rotationally identical except for 6r6c2 (added to achieve uniqueness)
In the hope that this is of some interest (and see my post in the General Forum).
Regards,
Mike