Abstract: This paper presents a detailed comparison of three popular path-finding algorithms: BFS, Dijkstra’s algorithm, and A*, for solving 2D mazes. Path-finding is a widely studied problem in ...

Abstract: This study examines the performance of the Dijkstra and A* algorithms in uncovering the shortest path for strategic movement on the Sunset map in the game Valorant. Both algorithms were ...