A browser-based visualizer for exploring pathfinding algorithms on a grid. Draw walls, set start/end points, and watch algorithms find the shortest path in real time.

No build tools required—simply open index.html in your browser.

• Interactive grid with click-and-drag wall drawing
• Move start (right-click) and end (Ctrl+click) nodes
• Choose between A*, Dijkstra, BFS, DFS, and Q-Learning algorithms
• Animate searches with adjustable speed
• Generate random mazes
• Responsive design for desktop and mobile

1. Clone or download the repository.
2. Open index.html in any modern browser.
3. Draw walls on the grid, set start/end nodes, select an algorithm, and click Find Path.
4. Use Clear Path to reset the last search, Reset Grid to clear walls, and Generate Maze to create a new maze.

1. Fork the repo and create a feature branch.
2. Implement changes, following existing code style.
3. Submit a pull request with a clear description of your changes.

MIT License. Feel free to use or modify for educational purposes.