ascii-maze-factory

1#!/usr/bin/env python3
2"""
3Sidney's Algorithm (Sidewinder Variant) Maze Generator
4
5A simple sidewinder-like algorithm that processes row by row.
6For each cell, it decides to either carve East or carve North from a run.
7"""
8
9import random
10import sys
11
12def generate_sidney_maze(width: int = 21, height: int = 11) -> list[list[str]]:
13    # Ensure odd dimensions
14    width = width if width % 2 == 1 else width + 1
15    height = height if height % 2 == 1 else height + 1
16    
17    maze = [['#' for _ in range(width)] for _ in range(height)]
18    
19    # Process rows (skipping boundaries)
20    for y in range(1, height - 1, 2):
21        run = []
22        for x in range(1, width - 1, 2):
23            maze[y][x] = ' '
24            run.append((x, y))
25            
26            at_eastern_boundary = (x == width - 2)
27            at_northern_boundary = (y == 1)
28            
29            # Should we close the run? (Always at East boundary, never at North boundary alone)
30            should_close = at_eastern_boundary or (not at_northern_boundary and random.choice([True, False]))
31            
32            if should_close:
33                # Pick a random cell from the run and carve North
34                if not at_northern_boundary:
35                    member_x, member_y = random.choice(run)
36                    maze[member_y - 1][member_x] = ' '
37                run = []
38            else:
39                # Carve East
40                maze[y][x + 1] = ' '
41                
42    # Entrance and Exit
43    maze[0][1] = ' '
44    maze[height - 1][width - 2] = ' '
45    
46    return maze
47
48def print_maze(maze: list[list[str]]) -> None:
49    for row in maze:
50        print(''.join(row))
51
52def main():
53    width = int(sys.argv[1]) if len(sys.argv) > 1 else 21
54    height = int(sys.argv[2]) if len(sys.argv) > 2 else 11
55    maze = generate_sidney_maze(width, height)
56    print_maze(maze)
57
58if __name__ == '__main__':
59    main()
60