ascii-maze-factory

1import random
2
3def generate_binary_tree_maze(width, height):
4    """
5    Generates a maze using the Binary Tree algorithm.
6    For each cell, it randomly chooses to carve either North or East.
7    Resulting maze always has a clear path along the North and East boundaries.
8    """
9    grid_w = width * 2 + 1
10    grid_h = height * 2 + 1
11    grid = [[1 for _ in range(grid_w)] for _ in range(grid_h)]
12
13    for y in range(height):
14        for x in range(width):
15            gx, gy = x * 2 + 1, y * 2 + 1
16            grid[gy][gx] = 0 
17            neighbors = []
18            if x < width - 1:
19                neighbors.append('E')
20            if y < height - 1:
21                neighbors.append('S') 
22            if neighbors:
23                choice = random.choice(neighbors)
24                if choice == 'E':
25                    grid[gy][gx + 1] = 0
26                else:
27                    grid[gy + 1][gx] = 0
28    return grid
29
30def print_maze(grid):
31    for row in grid:
32        line = "".join(["#" if cell == 1 else " " for cell in row])
33        print(line)
34
35if __name__ == "__main__":
36    w, h = 15, 10
37    maze = generate_binary_tree_maze(w, h)
38    print_maze(maze)
39