Analysis of Multiple Shortest Path Finding Algorithm in Novel Gaming Scenario

  • Aqsa Zafar
  • Krishna Kant Agrawal
  • Wg. Cdr Anil Kumar
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 624)


The most important research area in gaming is shortest path finding. Many video games are facing the problem of path finding and there are many algorithms present to resolve the problem of shortest path finding such as breadth-first search, depth-first search, Dijkstra’s algorithm and best-first search. A* algorithm has been proved the best algorithm for resolving the problem of shortest path finding in games. It provides the optimal solution for path finding as compared to other search algorithm. In the starting section, brief introduction about the path finding is given. Then the reviews of different search algorithm are presented on the basis of path finding. After that information of A* algorithm is described. In the last, application and examples of how the path finding techniques are used in the game are addressed and future work and conclusion are drawn. In this paper, comparison is drawn on search algorithm on the basis of path finding in games. A* algorithm gives the optimal solution in a faster way as compare to other algorithm. A* uses a heuristic function and movement amount from start node to any other node n, so A* select the most promising node for expanding due to this property A* gives optimal solution.


Path finding Optimal path A* algorithm Shortest path Gaming scenario 


  1. 1.
    Xiang Xu and Kun Zou, “ An Improved Path finding Algorithm in RTS Games”, Communications in Computer and Information Science—Springer 153, pp. 1–7, 2011Google Scholar
  2. 2.
    Mehta Parth, Shah Hetasha, Shukla Soumya, Verma Saurav,” A Review on Algorithm for Path finding in Computer Games”, available at
  3. 3.
    Amit S. Wale, Taranpreet Singh Saini, Ahmed Mohammad Ali, Vandana S. Jagtap, “Survey Heuristic Search for Shortest Path finding in Games,” ISSN-Print 2393–8374, Online-ISSN 2394-0697, Vol 2, I 12, 2015Google Scholar
  4. 4.
    Geethu Elizebeth Mathew, “Direction Based Heuristic for Path finding in Video Games”, Procedia of Computer Science 47, 262–271, 2015Google Scholar
  5. 5.
    Xiao Cui and Hao Shi, “A*- based Path finding in Modern Computer Games,” IJCSNS, School of Engineering and Science, Victoria University, Melbourne, Australia, International Journal of Computer Science and Network Security, p 125, Vol 11, No 1, Jan 2011Google Scholar
  6. 6.
    Rubén Tous, “Real Time Planning for Path-finding in Computer Games”Google Scholar
  7. 7.
    Age of Empire Game by Microsoft games/ empires, read on January 10, 2017
  8. 8.
    Rubén Tous, “Real Time Planning for Path-finding in Computer Games”, Universitat Pompeu Fabra (UPF), Department de Tecnologia, SpainGoogle Scholar
  9. 9.
    Firaxis Games, “Sid Meier’s Civilization V”,, read on January 10, 2017
  10. 10.
    N. H. Barnouti, Al-Dabbagh S S M and Naser M A S “Path finding in Strategy Games & Maze Solving Using A* Search Algorithm” (2016) Journal of Computer and Communication, 4, 15–25. 2016.411002
  11. 11.
    Guni Sharon, “Thesis Summary Optimal Multi-Agent Path finding Algorithm”, Published at Twenty Ninth AAAI-Conference on Artificial Intelligence ProceedingsGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Aqsa Zafar
    • 1
  • Krishna Kant Agrawal
    • 1
  • Wg. Cdr Anil Kumar
    • 2
  1. 1.Department of Computer ScienceAmity UniversityLucknowIndia
  2. 2.Amity School of Engineering and TechnologyAmity UniversityLucknowIndia

Personalised recommendations