Maze Solver BFS

Overview

This project implements a maze solver using the Breadth-First Search (BFS) algorithm. It finds the shortest path from a starting point to the goal in mazes represented as grids, visualizing both the exploration process and the final solution. Ideal for learning about search algorithms and data structures in artificial intelligence. Live at https://maze-solver-bfs.vercel.app. Open-source project by Sthefany Angeles, published on GitHub.

Highlights

• 1 star on GitHub
• Primary language: Python
• Open source — view the code and contribute on GitHub

Built with

• Python