完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Lin, Hung-Hsuan | en_US |
dc.contributor.author | Wu, I-Chen | en_US |
dc.contributor.author | Wei, Tinghan | en_US |
dc.date.accessioned | 2014-12-08T15:34:24Z | - |
dc.date.available | 2014-12-08T15:34:24Z | - |
dc.date.issued | 2013-09-01 | en_US |
dc.identifier.issn | 1389-6911 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/23547 | - |
dc.description.abstract | Since 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.iso | en_US | en_US |
dc.title | ON SPECIFIC 17-CLUE SUDOKU PUZZLES | en_US |
dc.type | Article | en_US |
dc.identifier.journal | ICGA JOURNAL | en_US |
dc.citation.volume | 36 | en_US |
dc.citation.issue | 3 | en_US |
dc.citation.spage | 131 | en_US |
dc.citation.epage | 138 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000330091400002 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |