摘要
最短路径搜索是directx游戏的一项核心技术,文章分析了常用的搜索算法:宽度优先,深度优先和启发式搜索,最后剖析采用搜索树的A*算法来实现大地图与复杂地形的最短路径搜索。
Shortest Path Search is one of core technologies of game based on directx,this paper analyzes the common search method:breadth_first,depth_first and heuristic_Search,finally presents the a Star algorithm using searching tree to realize a shortest path finder in big size map with complicated obstacle.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第24期115-117,共3页
Computer Engineering and Applications
关键词
宽度优先
深度优先
启发式搜索
搜索树A^*寻径
breadth_first,depth_first,heuristic_search,searching tree,A Star Path Finder