摘要
为了求解数独难题,首先将其转化成一个组合优化问题。然后,提出一个在编码、初始化、交叉、变异、局部搜索等方面具有特点的遗传算法来求解它。实验结果表明,对于所有难度等级的数独难题,算法都是有效的。
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