Maze solver using BFS

Maze Solver

A Python-based Maze Solver project that finds the optimal path through a maze using Breadth-First Search (BFS) algorithm. The project visualizes the maze-solving process step by step, showing how the algorithm explores different paths until it reaches the destination.

Technologies: Python, Algorithms, Data Structures, BFS, Visualization.

Key Features:

* Solves mazes automatically using BFS.

* Finds the shortest path from the start point to the destination.

* Visualizes the exploration and final solution.

* Demonstrates practical applications of graph traversal algorithms.