APPLICATION OF MAINTAINING THE SHORTEST PATH METHOD IN THE GAME MAP PATH-FINDING
Path-Finding algorithms mainly solve the problem of how to find a path from the starting point to the target point If there is no connected path, the game will enter the deadlock state. This paper focuses on analyzing the rule of picture matching, giving the estimated formula and process of the A * algorithm in this game, and introducing a typical determining deadlock algorithm: the A* algorithm-based method to maintain the shortest path. Moreover, the paper pointed out the data structure of the game map and elaborated the algorithm thought of maintaining the shortest path. Then it described the specific steps of the algorithm.
the shortest path path-finding game map
Zheng-hong Hu Jin Li
Computer Science Department Taiyuan Normal University Taiyuan, Shanxi 030012,China
国际会议
International Conference on Computational Aspects of Social Networks(国际社会网络计算会议 CASoN 2010)
太原
英文
737-740
2010-09-26(万方平台首次上网日期,不代表论文的发表时间)