We have a hunch, but no proof regarding the minimum number of clues for a classic sudoku. I can't find anything about minimum clues for a jigsaw. This depends on the pattern, of course.
Does anybody know what the best pattern is to generate low-clue jigsaws and what the minimum number of clues are for certain patterns? Has any research been done in this area?
This is what triggered my question. A 15-clue jigsaw, which is solved with singles and a few LoL eliminations.
- Code: Select all
.---------------.---.---------------.
| . . . . | . | . . 9 . |
| .-------' '---. |
| 7 . | . . . 3 | . . . |
| |---. .---. '---.---. |
| . . | . | . | . | 8 . | . | 1 |
| .---' '---: | .---' | |
| . | . . . | . | . | 1 . | 3 |
:---' .-------' '---'---. '---:
| . . | . . 6 . . | . . |
:---. '---.---. .-------' .---:
| 3 | . 5 | . | . | . . . | . |
| | .---' | |---. .---' |
| 4 | . | . 1 | . | . | . | . . |
| '---'---. '---' '---: |
| . . . | 4 . . . | . 8 |
| '---. .-------' |
| . 9 . . | . | . . . . |
'---------------'---'---------------'
I was amazed that the same number of constraints could result in less clues required.
Any thoughts on this?
Ruud.