计算机科学 ›› 2010, Vol. 37 ›› Issue (3): 225-226233.
• 人工智能 • 上一篇 下一篇
刘延风，刘三阳
出版日期:
发布日期:
LIU Yan-feng,LIU San-yang
Online:
Published:
摘要： 为了求解数独难题，首先将其转化成一个组合优化问题。然后，提出一个在编码、初始化、交又、变异、局部搜索等方面具有特点的遗传算法来求解它。实验结果表明，对于所有难度等级的数独难题，算法都是有效的。
关键词: 遗传算法，数独难题，局部搜索
Abstract: To solve the Sudoku puzzles, above all, they were changed into a combinatorial optimization problem. I}hen, 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.
Key words: Genetic algorithm,Sudoku puzzle,Loca1 search
刘延风，刘三阳. 基于遗传算法求解数独难题[J]. 计算机科学, 2010, 37(3): 225-226233. https://doi.org/
LIU Yan-feng,LIU San-yang. Algorithm Based on Genetic Algorithm for Sudoku Puzzles[J]. Computer Science, 2010, 37(3): 225-226233. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2010/V37/I3/225
Cited
首页