🏁 Maze Generator + A* Solver

An animated Maze Generator and Pathfinding Solver built with C++ and SFML 3.0, featuring recursive backtracking generation and A* algorithm visualization.

✨ Features

• Recursive Backtracking — maze generated step-by-step with animated frontier cell
• A Pathfinding* — optimal path found with full exploration visualization
• Color-coded Display — teal for A* explored cells, rainbow gradient for the final path
• 60×40 Grid — 2400 cells, genuinely complex mazes every run
• Fast Mode — instant generation and solving with F key
• Infinite Regeneration — new random maze every time with Space

🛠️ Built With

• C++17
• SFML 3.0.2
• CMake + MinGW

▶️ How to Run

1. Download MazeGenerator-v1.0-Windows.zip from Releases
2. Extract all files to the same folder
3. Run MazeGenerator.exe

Requires Windows. No install needed — just extract and run.

🎮 Controls

Key	Action
Space	Generate new maze
Enter	Solve with A* algorithm
F	Toggle fast mode (instant)
R	Reset
Esc	Quit

⚙️ Build from Source

git clone https://github.com/snehal-thombare08/Maze-Generator-Solver.git
cd Maze-Generator-Solver
mkdir build && cd build
cmake .. -DCMAKE_TOOLCHAIN_FILE=C:/vcpkg/scripts/buildsystems/vcpkg.cmake -G "MinGW Makefiles"
mingw32-make

📁 Project Structure

Maze-Generator-Solver/
├── src/
│   └── main.cpp
├── CMakeLists.txt
└── README.md

---

Part of a C++ graphics & simulation portfolio built with SFML 3.0.