What is the minimum value of the sum of the digits of a minimal puzzle?
As a benchmark, Jason calculated here the minimum for the known 17s : 58
I confirm this number.
There are 30 puzzles with sum = 58.
Here is an exemple :
- Code: Select all
. . . | 4 2 . | 1 . .
. 3 . | . . . | . . 5
. . . | . . 1 | . . .
-------+-------+-------
7 2 4 | . . . | . . .
. . . | 3 . . | . 6 .
. . 1 | . . . | . . .
-------+-------+-------
8 . . | 5 1 . | . . .
. . . | . . . | 2 3 .
. . . | . . . | . . .
I propose to set up records for different numbers of clues.
The next post is supposed to list the records.
JPF