Dynamic Maze Solver: Integrating Advanced Algorithms for Optimal Path-finding in Varied Environments

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 Algorithm, our solver offers adaptability and efficiency in finding the optimal path from user-defined start to end nodes. We demonstrate the versatility of our approach through rigorous testing on a diverse set of mazes encompassing different constraints. Performance metrics including path length, execution time, and optimum path are evaluated. The results showcase the algorithm’s effectiveness in applications ranging from robotics navigation to game level design. Index Terms—Dynamic maze, Dijkstra’s Algorithm, A* Algorithm, Optimal Path