Application of Improved A* Algorithm in Game Pathfinding

Pathfinding is a very important element in game development. A* algorithm is widely used in game pathfinding, and is one of the more popular heuristic search algorithms. In order to realize the application of the algorithm in different game map scenes and improve the execution efficiency of the A* algorithm, this paper presents an improved A* algorithm. Multiple nodes with the lowest evaluation value in the open list are reprocessed, the node with the lowest h(n) is selected as the nodeto be processed, and the node in the close list is reutilized. At the same time, a new heuristic function is constructed for the map environment. Experiments show that the proposed algorithm can effectively find the shortest path in the game map, shorten the time consumption of path finding, and improve the playability of the game.