2D游戏地图的寻路实现

Implementation of Path Finding on 2D Game Maps

对2D游戏领域的地图寻路算法进行了研究。阐述了A*寻路算法和D*寻路算法,并在Blitz Basic2D游戏开发平台仿真实现了2种路径搜索算法。实验结果表明:A*算法适合在静态地图中搜索路径,而D*算法在动态地图中搜索路径更迅速、有效,且随着结点数量的增加,D*算法优于A*算法。

Researched into path finding algorithm on map in the field of 2D game. Expounded A＊ algorithm and D＊ algorithm and simulated two path-search algorithms on the Blitz Basic 2D game development platform. Experimental results indicate that A＊ algorithm is suitable for searching path on static game map, D＊ algorithm is very quickly and effectively when searching path in dynamic game map environment, and as the number of nodes increasing, the performance of D＊ is better than A＊.