Skip to content

Generates a random maze and solves it using recursive backtracking. The maze generation utilizes Depth-First Search (DFS) to carve out passages and create a unique maze layout for each run.

Notifications You must be signed in to change notification settings

lnvaldez/maze-solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 

Repository files navigation

📝 Maze Solver

This project generates a random maze and solves it using recursive backtracking. The maze generation utilizes Depth-First Search (DFS) to carve out passages and create unique maze layouts for each run.

✏️ Features

  • Uses DFS to generate a maze
  • Random path carving to enhance maze complexity
  • Maze generation visualization
  • Recursive bactracking to solve the maze
  • Interactive play mode

🧑🏽‍💻 How to Run

Prerequisites

  • Make sure you have a C++ compiler installed, like g++.
  • The code is designed to run on Unix-like systems (Linux or macOS) due to the use of ANSI escape codes for terminal control. Windows might require a terminal that supports ANSI codes.

Compile and Run

$ git clone git@github.com:lnvaldez/maze-solver.git
$ cd maze-solver
$ g++ maze.cpp -o out
$ ./out

🤝 Contributing 🤝

  • Feel free to Fork this repository, create a feature branch and submit a pull request

About

Generates a random maze and solves it using recursive backtracking. The maze generation utilizes Depth-First Search (DFS) to carve out passages and create a unique maze layout for each run.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages