A~*算法在游戏地图寻径中的应用与实现  

APPLICATION AND IMPLEMENTATION OF A~ALGORITHMS IN THE GAME MAP PATH-FINDING

作　　者：陈和平[1] 张前哨[1] 

机构地区：[1]武汉科技大学信息科学与工程学院,湖北武汉430081

出　　处：《计算机应用与软件》2005年第12期118-120,共3页Computer Applications and Software

摘　　要：寻径算法主要解决如何从图中寻找一条从起点到目标点的路径问题。本文分析了网络游戏中地图文件结构,比较了几种地图寻径算法,并重点介绍了一种典型的启发式搜索算法—A*算法原理及其在游戏地图寻径中的具体实现方法。该算法简单、快捷,在实际应用中获得了较好的效果。Path-Finding algorithms mainly solve how to find a path from the start point to the finish point on the map. This paper focuses on analyzing the structure of the network game map file, comparing several map Path-Finding algorithms and introducing a typical Heuristic Searching algorithm-the principle of A algorithms and the realization of it in the game map Path-Finding. This algorithm is simple and effective, a good result is obtained in the practice of the game map Path-Finding.

关 键 词：地图寻径 启发式搜索 A算法 游戏地图 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TS952.83[自动化与计算机技术—计算机科学与技术]