节点文献
数码谜题求解的算法设计及其扩展研究
Algorithm Design and Extension Research of N-Puzzle Problem
【摘要】 数码谜题是人工智能领域中的经典问题。结合低阶数码谜题求解的具体实现过程,分析了求解高阶数码谜题的存储机制设计、可解性判断、移动规则设计及搜索策略。与传统搜索算法相比,A*算法具有求解快、占用内存小的特点,研究了该算法框架下的启发函数改进及向高阶数码谜题求解的扩展。实验结果证明了该算法的有效性。
【Abstract】 N-puzzle is a classic problem in artificial intelligence.Combining with the implementation process of solving 8-puzzle,analyzed the designing of the storage mechanism,judging of the solvability,designing of moving rules,and search strategy of solving n-puzzle problem.Compared with traditional search algorithm,A* algorithm has faster speed and less memory usage.Based on the framework of A* algorithm,researched the improvement on the heuristic function and the extension toward solving the n-puzzle.The experiment results have illustrated the effectiveness of this algorithm.
- 【文献出处】 计算机技术与发展 ,Computer Technology and Development , 编辑部邮箱 ,2009年08期
- 【分类号】TP18
- 【下载频次】91