Solve large Maze problems, using graphs
Did this project in my free time after getting inspiration from Professor Michael Pound's video on Computerphile. This is my implemetation of the same project in JAVA.
Implemeted graph search algorithms for finding the path through large mazes. Given the path to the input maze the program give the time to solve the maze and output solved maze.
Implemented algorithms
- Depth First Search
- Breadth First Search
- A* Search
For playing around and experiments more exaples can be found here. Again Micheal Pound's courtesy.