Skip to content

manastahir/Maze-solver-in-Java

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Maze-solver-in-Java

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.

About the project

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
Note: The code assumes that white pixel is the path, black is the wall, entry is on the top wall and exit is on the bottom wall. These limitations could have been solved

Sample output

For playing around and experiments more exaples can be found here. Again Micheal Pound's courtesy.

About

Solve large Maze problems, using graphs

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages