DocumentCode :
3108203
Title :
Application of Maintaining the Shortest Path Method in the Game Map Path-Finding
Author :
Hu, Zheng-Hong ; Li, Jin
Author_Institution :
Comput. Sci. Dept., Taiyuan Normal Univ., Taiyuan, China
fYear :
2010
fDate :
26-28 Sept. 2010
Firstpage :
737
Lastpage :
740
Abstract :
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.
Keywords :
game theory; graph theory; A* algorithm; data structure; deadlock algorithm; deadlock state; game map; path-finding algorithm; picture matching; shortest path method; Algorithm design and analysis; Arrays; Games; Heuristic algorithms; System recovery; Windings; game map; path-finding; the shortest path;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Aspects of Social Networks (CASoN), 2010 International Conference on
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4244-8785-1
Type :
conf
DOI :
10.1109/CASoN.2010.169
Filename :
5636942
Link To Document :
بازگشت