期刊文献+

基于遗传算法求解数独难题 被引量:11

Algorithm Based on Genetic Algorithm for Sudoku Puzzles
下载PDF
导出
摘要 为了求解数独难题,首先将其转化成一个组合优化问题。然后,提出一个在编码、初始化、交叉、变异、局部搜索等方面具有特点的遗传算法来求解它。实验结果表明,对于所有难度等级的数独难题,算法都是有效的。 To solve the Sudoku puzzles, above all, they were changed into a combinatorial optimization problem. Then, a genetic algorithm with specialized encoding, initialization and local search operator was presented to optimize it. The experimental results show the algorithm is effective for all difficulty levels Sudoku puzzles.
出处 《计算机科学》 CSCD 北大核心 2010年第3期225-226,233,共3页 Computer Science
关键词 遗传算法 数独难题 局部搜索 Genetic algorithm,Sudoku puzzle,Local search
  • 相关文献

参考文献5

  • 1孟庆铃.数独问题人工解法的程序实现[J].甘肃科技,2006,22(9):150-151. 被引量:6
  • 2Yato T, Seta T. Complexity and Completeness of Finfing Solution and Its Application to Puzzles[J]. IEICE Trans. Fundamentals, 2003, E86-A(5) :1052-1060.
  • 3Lewis R. Metaheuristics can solve sudoku puzzles[J]. Journal of Heuristics, 2007,13 : 387-401.
  • 4Mantere T, Koljonen J. Solving and rating sudoku puzzles with Genetic Algorithm[C]//Proceedings of the 12^th Finish Artificial Intelligenee Conference. Sept. 2006.
  • 5GoldbergDE, AllelesLR. TheTravelingSalesmanProblem[C] // Proceedings of an International Conference on Genetic Algorithms and Their Applications. 1985:154-159.

共引文献5

同被引文献57

引证文献11

二级引证文献26

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部