完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Hung-Hsuanen_US
dc.contributor.authorWu, I-Chenen_US
dc.contributor.authorWei, Tinghanen_US
dc.date.accessioned2014-12-08T15:34:24Z-
dc.date.available2014-12-08T15:34:24Z-
dc.date.issued2013-09-01en_US
dc.identifier.issn1389-6911en_US
dc.identifier.urihttp://hdl.handle.net/11536/23547-
dc.description.abstractSince Sudoku was invented, it has been interesting to find Sudoku puzzles with the minimum number of clues. Royle collected 49,151 17-clue Sudoku puzzles between 2005 and 2009, each of which is not isomorphic to any other, and McGuire claimed in 2012 that no 16-clue Sudoku puzzle exists. Since 2009, no new 17-clue Sudoku puzzles have been found. This paper proposes an algorithm to find 17-clue Sudoku puzzles based on the number of clues in the topmost 9x3 cells, which is called a top-block. Using this algorithm, we prove that (1) no 17-clue puzzles exist of which the top-block has fewer than three clues and (2) precisely 95 17-clue puzzles exist of which the top-block has three and only three clues. Moreover, we compared these 95 puzzles to the 49,151 collected 17-clue Sudoku puzzles and found that these 95 puzzles are already collected by Royle. Thus, a conjecture from this paper is that most of the 17-clue Sudoku puzzles have been found.en_US
dc.language.isoen_USen_US
dc.titleON SPECIFIC 17-CLUE SUDOKU PUZZLESen_US
dc.typeArticleen_US
dc.identifier.journalICGA JOURNALen_US
dc.citation.volume36en_US
dc.citation.issue3en_US
dc.citation.spage131en_US
dc.citation.epage138en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000330091400002-
dc.citation.woscount0-
顯示於類別:期刊論文