Add Binary Tree maze generator algorithm

new file mode 100644

@@ -0,0 +1,38 @@

import random

def generate_binary_tree_maze(width, height):

    """

    Generates a maze using the Binary Tree algorithm.

    For each cell, it randomly chooses to carve either North or East.

    Resulting maze always has a clear path along the North and East boundaries.

    """

    grid_w = width * 2 + 1

    grid_h = height * 2 + 1

    grid = [[1 for _ in range(grid_w)] for _ in range(grid_h)]

    for y in range(height):

        for x in range(width):

            gx, gy = x * 2 + 1, y * 2 + 1

            grid[gy][gx] = 0 

            neighbors = []

            if x < width - 1:

                neighbors.append('E')

            if y < height - 1:

                neighbors.append('S') 

            if neighbors:

                choice = random.choice(neighbors)

                if choice == 'E':

                    grid[gy][gx + 1] = 0

                else:

                    grid[gy + 1][gx] = 0

    return grid

def print_maze(grid):

    for row in grid:

        line = "".join(["#" if cell == 1 else " " for cell in row])

        print(line)

if __name__ == "__main__":

    w, h = 15, 10

    maze = generate_binary_tree_maze(w, h)

    print_maze(maze)