An interactive maze game that uses Dijkstra's algorithm for both maze generation and pathfinding. Play through randomly generated mazes and find the optimal path to the exit!
- 🔄 Random maze generation using Depth-First Search
- 🤖 Pathfinding using Dijkstra's algorithm
- 🎲 Dynamic maze regeneration
- 🎯 Interactive gameplay with keyboard controls
- 🗺️ Visual solution path display
- 🏆 Move counter and win detection
- ⌨️ Support for both WASD and arrow keys
- 🐍 Python (Backend)
- NumPy
- Matplotlib
- ⚛️ React (Frontend)
- Tailwind CSS
- Lucide Icons
- shadcn/ui components
- 🧮 Algorithms
- Dijkstra's Algorithm (Pathfinding)
- Depth-First Search (Maze Generation)
# Python dependencies
pip install numpy matplotlib
# Node.js dependencies
npm installfrom maze_solver import create_and_solve_maze
# Create a 15x15 maze
maze, solution = create_and_solve_maze(15, 15)# Start the development server
npm run dev- 🎲 Use arrow keys or WASD to move the blue player dot
- 🏁 Navigate from the green start to the red end
- 🔄 Click "New Maze" to generate a fresh maze
- 👁️ Toggle solution visibility with the eye icon
- 🎯 Try to reach the end in the minimum number of moves!
- 🔵 Blue dot: Player
- ⬛ Black squares: Walls
- ⬜ White squares: Paths
- 🟩 Green square: Start
- 🟥 Red square: End
- 💫 Yellow path: Optimal solution (when visible)
- 📊 High score system
- ⏱️ Time tracking
- 🎨 Custom themes
- 🔧 Adjustable difficulty levels
- 📏 Different maze sizes
Feel free to open issues and pull requests for any improvements you'd like to add!
This project is licensed under the MIT License - see the LICENSE file for details.
- Built using React and Python
- UI components from shadcn/ui
- Icons from Lucide React