如何阻止我的递归除法迷宫算法堵塞漏洞？

def recursive_division(maze, x, y, width, height):
    if width < MIN_SIZE or height < MIN_SIZE:
        return  # 终止条件

    # 划分区域和打通墙壁的逻辑
    # ...

import random

def recursive_division(maze, x, y, width, height):
    if width < MIN_SIZE or height < MIN_SIZE:
        return

    if random.choice([True, False]):
        divide_vertically(maze, x, y, width, height)
    else:
        divide_horizontally(maze, x, y, width, height)

def connect_regions(maze, x1, y1, x2, y2):
    # 随机选择一个位置打通墙壁
    wall_x = random.randint(x1 + 1, x2 - 1)
    wall_y = random.randint(y1, y2)
    maze[wall_y][wall_x] = 0  # 0表示通路

MAX_RECURSION_DEPTH = 100

def recursive_division(maze, x, y, width, height, depth=0):
    if depth > MAX_RECURSION_DEPTH:
        return

    if width < MIN_SIZE or height < MIN_SIZE:
        return

    # 划分区域和打通墙壁的逻辑
    # ...