Simulation and Comparison of Efficency in Pathfinding algorithms in Games

There are several routes to go from point A to point B in many computer games and computer player have to choose the best route. To do this, the pathfinding algorithms is used. Currently, several algorithms have been proposed for routing in games so that the general challenges of them is high consumption of memory and a long Execution time. Due to these problems, the development and introduction of new algorithms will be continued. At the first part of this article, in addition to basic and important used algorithms, new algorithms BIDDFS is introduced.In the second part, this algorithms in the various modes, are simulated on 2D-Grid, and compared based on their efficency (memory consumption and execution time) , Simulated algorithms include: Dijkstra,IDDFS,BIDDFS,BFS(Breadth),Greedy Best First Search,Ida*,A*,Jump point search,HPA*.

کلیدواژه ها:

Biddfs ، JPS ، A* ، HPA* ، IDA *