How can I solve a maze using Python?

How can I solve a maze using Python?

You can solve a maze in Python using algorithms like Depth-First Search or Breadth-First Search. Do you have a specific maze format in mind?

I have a 2D list representing the maze. How do I implement Depth-First Search?

You can use recursion to implement Depth-First Search. Start from the entrance, mark the cell as visited, and explore each direction until you find the exit.

Can you provide a sample code for that?

Sure! Here's a simple implementation:

def dfs(maze, x, y, path):
    if maze[x][y] == 'E':  # E is the exit
        return path
    maze[x][y] = 'V'  # Mark as visited
    for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
        nx, ny = x + dx, y + dy
        if 0 <= nx < len(maze) and 0 <= ny < len(maze[0]) and maze[nx][ny] not in ['#', 'V']:
            result = dfs(maze, nx, ny, path + [(nx, ny)])
            if result:
                return result
    return None

Thanks! How do I represent the maze in the 2D list?

You can represent the maze as a list of lists, where '0' is a path, '1' is a wall, and 'E' is the exit. For example:

maze = [[0, 1, 0, 0],
        [0, 1, 1, 0],
        [0, 0, 0, 'E']]