Abstract: Most of existing path finding problems focused on searching a path with the minimum cost, such as shortest-path length and shortest travel time. In this paper, we consider a new path finding ...

Abstract: This project introduces a dynamic maze-solving algorithm capable of handling mazes of varying sizes, complexities, and configurations. Leveraging a combination of A* Algorithm and Dijkstra’s ...