ascii-maze-factory

1#!/usr/bin/env python3
2"""
3Simple BFS Maze Solver for ASCII Mazes.
4Identifies a path from entrance to exit.
5"""
6
7from collections import deque
8
9def solve_maze(maze):
10    height = len(maze)
11    width = len(maze[0])
12    
13    # Start (top entrance) and target (bottom exit)
14    start = (0, 1)
15    target = (height - 1, width - 2)
16    
17    queue = deque([start])
18    visited = {start: None} # node: parent
19    
20    while queue:
21        y, x = queue.popleft()
22        
23        if (y, x) == target:
24            break
25            
26        for dy, dx in [(0, 1), (0, -1), (1, 0), (-1, 0)]:
27            ny, nx = y + dy, x + dx
28            if 0 <= ny < height and 0 <= nx < width:
29                if maze[ny][nx] == ' ' and (ny, nx) not in visited:
30                    visited[(ny, nx)] = (y, x)
31                    queue.append((ny, nx))
32    
33    # Reconstruct path
34    path = []
35    curr = target
36    while curr:
37        path.append(curr)
38        curr = visited.get(curr)
39        
40    return path
41
42if __name__ == "__main__":
43    from maze_generator import generate_maze, print_maze
44    
45    maze = generate_maze(21, 11)
46    print("Generated Maze:")
47    print_maze(maze)
48    
49    path = solve_maze(maze)
50    
51    # Mark path with dots
52    for y, x in path:
53        if maze[y][x] == ' ':
54            maze[y][x] = '.'
55            
56    print("\nSolved Maze (Path marked with '.'):")
57    print_maze(maze)
58