Sudoku Programmers Forum Index

 
 FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister   ProfileProfile   Log inLog in          Games  Calendar

Log in to check your private messagesLog in to check your private messages   

Lowest number of candidates for 'trivial' puzzles

 
Post new topic   Reply to topic    Sudoku Programmers Forum Index -> Setting sudoku
View previous topic :: View next topic  
Author Message
Paul

Joined: 11 Aug 2005
Posts: 29
:

Items
PostPosted: Thu Oct 27, 2005 11:14 am    Post subject: Lowest number of candidates for 'trivial' puzzles Reply with quote

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
View user's profile Send private message Visit poster's website
Ruud
Site Admin
Joined: 17 Sep 2005
Posts: 708
:
Location: Netherlands

Items
PostPosted: Thu Oct 27, 2005 11:24 am    Post subject: Reply with quote

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
View user's profile Send private message Visit poster's website
Display posts from previous:   
Post new topic   Reply to topic    Sudoku Programmers Forum Index -> Setting sudoku All times are GMT
Page 1 of 1

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
Sudoku Programmers topic RSS feed 


Powered by phpBB © 2001, 2005 phpBB Group

Igloo Theme Version 1.0 :: Created By: Andrew Charron