How can I implement maze-solving algorithms in Python?

How can I implement maze-solving algorithms in Python?

You can implement maze-solving algorithms like Depth-First Search or A* in Python. Would you like a code example?

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

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

class Maze:
    def __init__(self, grid):
        self.grid = grid
        self.visited = set()

    def is_valid_move(self, x, y):
        return (0 <= x < len(self.grid) and 0 <= y < len(self.grid[0]) and
                self.grid[x][y] == 0 and (x, y) not in self.visited)

    def dfs(self, x, y):
        if not self.is_valid_move(x, y):
            return False
        if (x, y) == (len(self.grid)-1, len(self.grid[0])-1):
            return True
        self.visited.add((x, y))
        return (self.dfs(x+1, y) or self.dfs(x, y+1) or
                self.dfs(x-1, y) or self.dfs(x, y-1))

maze = Maze([[0, 0, 1], [1, 0, 0], [0, 0, 0]])
print(maze.dfs(0, 0))  # Output: True or False

What does the grid represent in this code?

In this code, the grid represents the maze where '0' indicates a path and '1' indicates a wall. You can modify it to create different mazes.