标题: 数独之最少提示数研究
The Study of Minimum Sudoku
作者: 黄裕龙
Huang, Yu-Long
吴毅成
Wu, I-Chen
资讯学院资讯学程
关键字: 数独;最少提示数;基因重整繁衍法;候选数解题法;Sudoku;Minimum Clues;genes restructuring algorithm;candidates algorithm
公开日期: 2008
摘要: 数独游戏的风行已经有几年了,这段时间中陆续有各式解题法被开发出来,其中以候选数演算法最广为大家所使用。近几年盘面产生器成了新的研究风潮,其中林顺喜教授指导开发了基因重整繁衍法,大量产生最少提示数盘面。

本篇论文研究候选数特性,以集合逻辑的观念,开发新的解题法,简化解题的架构及方法,减少解题所需时间;进而改良基因重整繁衍法,使盘面的产生更加快速。最后再根据盘面特征,快速的比对新产生的盘面是否已重复。
Sudoku has been popular for several years around the world. There have been many algorithms built for solving Sudoku, and among them, candidates algorithms remain the most popular nowadays. Also, researchers have long been focusing on the generators of puzzles. For instance, Lin & Lin (2008) proposed the “genes restructuring” algorithm which was able to generate a large amount of Minimum Sudoku puzzles.

This paper aims to study the properties of Sudoku candidates. Then it suggests a new algorithm based on logic and sets principle as well as simplifies the process of solving puzzles and shortens the solving time. In addition, this paper improves the “genes restructuring” algorithm to make the puzzles generating faster. Finally, it checks the newly-generated puzzles to verify if they are duplicated ones.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT009467599
http://hdl.handle.net/11536/82499
显示于类别:Thesis


文件中的档案:

  1. 759901.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.