Skip to content

(Maze Solver ) A visual pathfinding that lets you explore BFS, DFS , A* and Dijkstra's Search. Comes with a maze generator to challenge the algorithms.

Notifications You must be signed in to change notification settings

omda777/Maze-Solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Maze Solver

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

Demo

Maze Generation

Use Recursive backtracking with Randomized directions Maze Generation

Pathfinding Visualization

Pathfinding Solver

Features

  • 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

Getting Started

  1. Clone the repository:
git clone https://github.com/omda777/Maze-Solver.git
  1. Open index.html in your web browser or use a local server:
python -m http.server 8000
  1. Visit http://localhost:8000 in your browser

Algorithms

  • 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

About

(Maze Solver ) A visual pathfinding that lets you explore BFS, DFS , A* and Dijkstra's Search. Comes with a maze generator to challenge the algorithms.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published