How can I implement maze generation in Python?

How can I implement maze generation in Python?

You can use algorithms like Depth-First Search or Prim's algorithm to generate mazes. Would you like a code example?

Yes, please provide a code example using Depth-First Search.

Here's a simple implementation:

import random

def generate_maze(width, height):
    maze = [['#'] * width for _ in range(height)]
    stack = []
    start = (random.randint(0, height-1), random.randint(0, width-1))
    maze[start[0]][start[1]] = ' '
    stack.append(start)

    while stack:
        x, y = stack[-1]
        neighbors = []
        for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
            nx, ny = x + dx, y + dy
            if 0 <= nx < height and 0 <= ny < width and maze[nx][ny] == '#':
                neighbors.append((nx, ny))
        if neighbors:
            nx, ny = random.choice(neighbors)
            maze[nx][ny] = ' '
            stack.append((nx, ny))
        else:
            stack.pop()
    return maze

maze = generate_maze(10, 10)
for row in maze:
    print(''.join(row))

This will create a simple maze. Would you like to know more about how it works?

Yes, can you explain how the Depth-First Search algorithm works in this context?

Certainly! The Depth-First Search (DFS) algorithm explores as far as possible along each branch before backtracking. In the maze generation context, it starts from a random cell, marks it as part of the maze, and then randomly visits neighboring cells that haven't been visited yet. If it reaches a dead end, it backtracks to the last cell with unvisited neighbors and continues until all cells are visited.