基于A*算法的九宫格问题的设计与实现
esign and Implementation of Sudoku based on A* Algorithm
九宫格问题是在3*3的方格盘中放有8个数码，一个空格。空格上下左右的数码格可以移至空格位置。问题给定初始位置以及目标位置，要求通过一系列的数码移动将初始状态转变成为目标状态，因为是8个数码又称之为8数码问题。本文在基于A*算法的研究基础上，对九宫格问题进行了详细的功能模块设计以及实现，判断目标状态是否可达以及如何移动。A*算法应用于其中主要进行了最短路径搜索的功能。
Sudoku is made of eight numbers and one blank in 3*3 grids. The numbers around the blank can be moved into the blank. Given the initial status and target location of all grids,it is asked to do a series of movements to transfer the initial location to the target. It is called Eight Queens for eight numbers. This paper made a detailed design and implementation of the function modules for Sudoku on the research of A* algorithm, such as to decide the target location available or how to move.A* algorithm is mainly used to find the shortest path.
高锦春、胡鹤飞、袁东明、夏思雨
计算技术、计算机技术
计算机技术最短路径查找*算法九宫格
omputer TechnologyShortest Path SearchA* AlgorithmSudoku
高锦春,胡鹤飞,袁东明,夏思雨.基于A*算法的九宫格问题的设计与实现[EB/OL].(2012-01-06)[2025-07-18].http://www.paper.edu.cn/releasepaper/content/201201-173.点此复制
评论