Simulation and Comparison of Efficency in Pathfinding algorithms in Games

Authors

  • Azad Noori DQ-CCNE/UFSM
  • Farzad Moradi

DOI:

https://doi.org/10.5902/2179460X20778

Abstract

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, the new algorithm BIDDFS is introduced.In the second part, these 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*.

Downloads

Download data is not yet available.

Published

2015-12-19

How to Cite

Noori, A., & Moradi, F. (2015). Simulation and Comparison of Efficency in Pathfinding algorithms in Games. Ciência E Natura, 37, 230–238. https://doi.org/10.5902/2179460X20778

Issue

Section

Special Edition