An interactive web-based maze solver and pathfinding visualization tool.
Visualize BFS, DFS, Dijkstra, and A* in real time — with smooth animations, adjustable speed, and full control over maze creation.
🔗 Live Demo: @Link
Use Recursive backtracking with Randomized directions

- 4 Pathfinding Algorithms: BFS, DFS, Dijkstra's, and A*
- Interactive Maze Creation: Manual wall placement with drag support
- Automatic Maze Generation: Recursive backtracking algorithm
- Real-time Visualization: Step-by-step algorithm visualization with adjustable speed
- Customizable Grid: Adjustable size from 5x5 to 30x30
- Clone the repository:
git clone https://github.com/omda777/Maze-Solver.git- Open
index.htmlin your web browser or use a local server:
python -m http.server 8000- Visit
http://localhost:8000in your browser
- BFS: Guarantees shortest path in unweighted graphs
- DFS: Explores deeply before backtracking
- Dijkstra's: Finds shortest path in weighted graphs
- A*: Heuristic-based optimal pathfinding
