Instructions

Project Title: Maze Solver with DFS and BFS

Project Description: Create a Python program to generate a random maze, represent it as a grid of nodes, and then use Depth$-$First Search $($DFS$)$ and Breadth$-$First Search $($BFS$)$ algorithms to find the path from the start to the goal in the maze.

Key Features

Maze Generation:

$-$ Generate a random maze as a grid with nodes.

$-$ The maze should have a start point, a goal point, walls, and open paths.

$-$ Use a library like Random to create the maze.

DFS Solver:

$-$ Implement the Depth$-$First Search algorithm to find a path from the start to the goal in the generated maze.

$-$ Visualize the DFS process step by step, showing how the algorithm explores the maze.

$-$ Use a stack data structure to keep track of nodes to visit.

BFS Solver:

$-$ Implement the Breadth$-$First Search algorithm to find a path from the start to the goal.

$-$ Visualize the BFS process, highlighting the breadth$-$first nature of exploration.

$-$ Use a queue data structure to manage node exploration.