View previous topic :: View next topic |
Author |
Message |
| Paul
| Joined: 11 Aug 2005 | Posts: 29 | : | | Items |
|
Posted: Thu Oct 27, 2005 11:14 am Post subject: Lowest number of candidates for 'trivial' puzzles |
|
|
I know 17 appears to be the lowest number for setting sudokus, but what is the lowest number of candidates for a 'trivial' puzzle? (i.e. one requiring no elimination techniques) |
|
Back to top |
|
|
| Ruud Site Admin
| Joined: 17 Sep 2005 | Posts: 708 | : | Location: Netherlands | Items |
|
Posted: Thu Oct 27, 2005 11:24 am Post subject: |
|
|
If no elimination techniques are allowed, the answer is 81.
If you can use singles only, the answer is 17.
Code: | . . .|. . .|. 1 2
. . .|. 3 5|. . .
. . .|6 . .|. 7 .
-----+-----+-----
7 . .|. . .|3 . .
. . .|4 . .|8 . .
1 . .|. . .|. . .
-----+-----+-----
. . .|1 2 .|. . .
. 8 .|. . .|. 4 .
. 5 .|. . .|6 . . |
Ruud |
|
Back to top |
|
|
|