Skip to content

Maze Solver with a GUI that visualizes DFS, BFS, and Greedy BFS algorithms.

License

Notifications You must be signed in to change notification settings

Jee-El/maze-solver

Repository files navigation

maze-solver

About

I made this project for two reasons :

  • It is the language taught at my school so I decided to go ahead and play around with it.

  • It is going to be presented in a school project my team and I are working on.

Features :

  • It is possible to solve any maze (duh!) as long as :

    • A solution exists

    • It follows the following format :

      • Walls/Obstacles are represented with a #

      • The start and end points are marked, respectively, with A and B

      • Everything else is represented with an empty space.

  • It has these algorithms implemented and available for use :

    • Depth-First-Search

    • Breadth-First-Search

    • Greedy Best-First-Search

  • It counts how many states were explored and displays it in your terminal.

Requirements to run this project :

  • Python

  • PyGame

How To Use :

  • Press enter to progress by one move.

  • Press escape to jump straight to the solution/end.

Releases

No releases published

Packages

No packages published

Languages