关键词: 游戏地图, 路径, 分支限界, 搜索

Abstract: Analyzed the algorithm of breadth-first, depth-first and heuristic-Search in path-finding for the map of game, put forward the Branch-and-Bound algorithm marking path directly based on breadth-first, the algorithm can find the shortest path by using O (N+L) at most, and can meet the path-finding requirements for game map with complicated landform.

Key words: game map, path, Branch-and-Bound, search