Dynamic Maze Solver using BFS

[Ujjansh05]

Implementation

This adds a dynamic maze visualization tool that demonstrates a BFS (Breadth-First Search) algorithm solving a maze in real-time. The visualizer features:

• A solver moving step-by-step toward a target.
• Dynamic obstacles that randomly appear or disappear.
• A moving target that changes position every few frames.
• A breadcrumb trail showing the solver’s path history.
• A visual overlay of visited nodes and the currently computed path.
• Animated plotting with colors, transparency, and smooth updates for a visually appealing effect.

The animation clearly shows how BFS explores the maze and adapts to changes, making it both educational and visually engaging.

Additional information

• The animation uses matplotlib with FuncAnimation for frame updates.
• Configurable parameters include step delay, target move interval, and obstacle change probability.
• The maze, start, and target positions are customizable.