Add Sidney's Algorithm (Sidewinder Variant) maze generator

new file mode 100755

@@ -0,0 +1,59 @@

#!/usr/bin/env python3

"""

Sidney's Algorithm (Sidewinder Variant) Maze Generator

A simple sidewinder-like algorithm that processes row by row.

For each cell, it decides to either carve East or carve North from a run.

"""

import random

import sys

def generate_sidney_maze(width: int = 21, height: int = 11) -> list[list[str]]:

    # Ensure odd dimensions

    width = width if width % 2 == 1 else width + 1

    height = height if height % 2 == 1 else height + 1

    maze = [['#' for _ in range(width)] for _ in range(height)]

    # Process rows (skipping boundaries)

    for y in range(1, height - 1, 2):

        run = []

        for x in range(1, width - 1, 2):

            maze[y][x] = ' '

            run.append((x, y))

            at_eastern_boundary = (x == width - 2)

            at_northern_boundary = (y == 1)

            # Should we close the run? (Always at East boundary, never at North boundary alone)

            should_close = at_eastern_boundary or (not at_northern_boundary and random.choice([True, False]))

            if should_close:

                # Pick a random cell from the run and carve North

                if not at_northern_boundary:

                    member_x, member_y = random.choice(run)

                    maze[member_y - 1][member_x] = ' '

                run = []

            else:

                # Carve East

                maze[y][x + 1] = ' '

    # Entrance and Exit

    maze[0][1] = ' '

    maze[height - 1][width - 2] = ' '

    return maze

def print_maze(maze: list[list[str]]) -> None:

    for row in maze:

        print(''.join(row))

def main():

    width = int(sys.argv[1]) if len(sys.argv) > 1 else 21

    height = int(sys.argv[2]) if len(sys.argv) > 2 else 11

    maze = generate_sidney_maze(width, height)

    print_maze(maze)

if __name__ == '__main__':

    main()