Application of Maintaining the Shortest Path Method in the Game Map Path-Finding

Path-Finding algorithms mainly solve the problem of how to find a path from the starting point to the target point. If there is no connected path, the game will enter the deadlock state. This paper focuses on analyzing the rule of picture matching, giving the estimated formula and process of the A* algorithm in this game, and introducing a typical determining deadlock algorithm: the A* algorithm-based method to maintain the shortest path. Moreover, the paper pointed out the data structure of the game map and elaborated the algorithm thought of maintaining the shortest path. Then it described the specific steps of the algorithm.