Author:
Patil Anshul,Kamboj Shreshtha,Bajaj Anu,Abraham Ajith
Publisher
Springer Nature Switzerland
Reference19 articles.
1. Barnouti, N.H., Al-Dabbagh, S.S.M., Naser, M.A.S.: Pathfinding in strategy games and maze solving using A* search algorithm. J. Comput. Commun. 4(11), 15 (2016)
2. Leigh, R., Louis, S.J., Miles, C.: Using a genetic algorithm to explore A*-like pathfinding algorithms. In: 2007 IEEE Symposium on Computational Intelligence and Games, pp. 72–79. IEEE, April 2007
3. Foead, D., Ghifari, A., Kusuma, M.B., Hanafiah, N., Gunawan, E.: A systematic literature review of A* pathfinding. Procedia Comput. Sci. 179, 507–514 (2021)
4. Kaur, N.K.S.: A review of various maze solving algorithms based on graph theory. IJSRD 6(12), 431–434 (2019)
5. Cui, X., Shi, H.: A*-based pathfinding in modern computer games. Int. J. Comput. Sci. Netw. Secur. 11(1), 125–130 (2011)