feat: add simple BFS maze solver

new file mode 100644

@@ -0,0 +1,57 @@

#!/usr/bin/env python3

"""

Simple BFS Maze Solver for ASCII Mazes.

Identifies a path from entrance to exit.

"""

from collections import deque

def solve_maze(maze):

    height = len(maze)

    width = len(maze[0])

    # Start (top entrance) and target (bottom exit)

    start = (0, 1)

    target = (height - 1, width - 2)

    queue = deque([start])

    visited = {start: None} # node: parent

    while queue:

        y, x = queue.popleft()

        if (y, x) == target:

            break

        for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:

            ny, nx = y + dy, x + dx

            if 0 <= ny < height and 0 <= nx < width:

                if maze[ny][nx] == ' ' and (ny, nx) not in visited:

                    visited[(ny, nx)] = (y, x)

                    queue.append((ny, nx))

    # Reconstruct path

    path = []

    curr = target

    while curr:

        path.append(curr)

        curr = visited.get(curr)

    return path

if __name__ == "__main__":

    from maze_generator import generate_maze, print_maze

    maze = generate_maze(21, 11)

    print("Generated Maze:")

    print_maze(maze)

    path = solve_maze(maze)

    # Mark path with dots

    for y, x in path:

        if maze[y][x] == ' ':

            maze[y][x] = '.'

    print("\nSolved Maze (Path marked with '.'):")

    print_maze(maze)