Maze Generator Solver

Finished

Mazes are an interesting application of graph and algorithm theory. They can be represented in many ways, but the objective is always to navigate from one tile to another (the exit). Using Python, Pygame, and NumPy, we employ pathfinding algorithms like A* or Greedy to find the best solution. Two different maze generation algorithms are used: Origin Shift and DFS. Various strategies are then applied to solve them based on different heuristics. Many others can be implemented (also, since DFS is a somewhat simplistic maze generator), so you are more than welcome to contribute!

Python

Pygame