Skip to content

Latest commit

 

History

History
9 lines (7 loc) · 726 Bytes

README.md

File metadata and controls

9 lines (7 loc) · 726 Bytes

Maze Solver 🌐

Introduction 🚀

This project tackles the classic maze problem by generating random mazes and using a brute-force search algorithm to find a solution. If a solution cannot be found, the system will generate a new maze and repeat the process.

Main Features 📋

  • Random Maze Generation: Generates a new maze with each execution, providing a unique challenge every time.
  • Brute Force Search: Explores all possible paths in the maze until a solution is found, showcasing the effectiveness of the algorithm in solving complex mazes.
  • Fallback for New Maze Generation: If no solution is found, the system automatically creates a new maze, ensuring there's always a challenge to overcome.