How can I implement maze algorithms in Python?

How can I implement maze algorithms in Python?

You can implement maze algorithms like Depth-First Search or Prim's algorithm in Python using lists and recursion.

Can you provide a sample code for Depth-First Search?

Sure! Here's a simple implementation of Depth-First Search for maze generation:

import random

class Maze:
    def __init__(self, width, height):
        self.width = width
        self.height = height
        self.grid = [['#'] * width for _ in range(height)]
        self.visited = [[False] * width for _ in range(height)]

    def generate(self, x=1, y=1):
        self.visited[y][x] = True
        self.grid[y][x] = ' '
        directions = [(0, 2), (2, 0), (0, -2), (-2, 0)]
        random.shuffle(directions)

        for dx, dy in directions:
            nx, ny = x + dx, y + dy
            if 0 < nx < self.width and 0 < ny < self.height and not self.visited[ny][nx]:
                self.grid[y + dy // 2][x + dx // 2] = ' '
                self.generate(nx, ny)

    def display(self):
        for row in self.grid:
            print(''.join(row))

maze = Maze(21, 21)
maze.generate()
maze.display()

What other algorithms can I use for maze generation?

You can also use algorithms like Prim's algorithm, Kruskal's algorithm, or Recursive Backtracking for maze generation.