DocumentCode
573006
Title
Battle city based on SAPF algorithm
Author
Luo, Wei ; Zhang, Dongqing
Author_Institution
Dept. of Comput. Sci. & Technol., Neusoft Inst. of Inf., Dalian, China
fYear
2012
fDate
24-26 Aug. 2012
Firstpage
1407
Lastpage
1410
Abstract
Battle City, I believe we are not unfamiliar. Suppose such a rule: on the map there are total of n mine, white and black tanks; Within the specified time, who occupies most of mine will come to victory. Notice that, the tank is running automatically, not manually controlled. Obviously, an efficient AI which is the core of game determines game´s outcome. How to occupy more mine in the shortest possible time, in other words, we should choose the shortest path to reach mine. Therefore, designing an efficient pathfinding algorithm is the key.
Keywords
artificial intelligence; computer games; graph theory; Battle City; SAPF algorithm; efficient AI; efficient pathfinding algorithm; shortest path; Algorithm design and analysis; A-star; BFS; Dijkstra; SAPF;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Processing (CSIP), 2012 International Conference on
Conference_Location
Xi´an, Shaanxi
Print_ISBN
978-1-4673-1410-7
Type
conf
DOI
10.1109/CSIP.2012.6309127
Filename
6309127
Link To Document