当然，我们可以使用二维数组（列表嵌套列表）来表示一个简单的Python迷宫。迷宫通常由墙壁（通常是`#`或`0`表示不可通行）和路径（通常是`.`或`1`表示可通行）组成。以下是一个基本的迷宫类的示例，包括创建、打印迷宫以及遍历的方法： ```python class Maze: def __init__(self, width, height): self.maze = [['.' for _ in range(width)] for _ in range(height)] self.start = (0, 0) # 假设开始位置在左上角 self.end = (width - 1, height - 1) # 结束位置在右下角 def create_maze(self): visited = set() stack = [(self.start)] while stack: x, y = stack.pop() if (x, y) == self.end: self.maze[x][y] = 'E' # 标记终点 elif (x, y) not in visited: directions = [(0, -1), (0, 1), (-1, 0), (1, 0)] # 上下左右四个方向 random_direction = directions[random.randint(0, len(directions) - 1)] new_x, new_y = x + random_direction[0], y + random_direction[1] if 0 <= new_x < len(self.maze) and 0 <= new_y < len(self.maze[0]) and self.maze[new_x][new_y] == '.': self.maze[x][y] = '|' self.maze[new_x][new_y] = '-' stack.append((new_x, new_y)) visited.add((x, y)) def print_maze(self): for row in self.maze: print(' '.join(row)) def explore_from_start(self, start=None): if start is None: start = self.start path = [start] x, y = start while True: neighbors = [(x + dx, y + dy) for dx, dy in [(0, -1), (0, 1), (-1, 0), (1, 0)] if 0 <= x + dx < len(self.maze) and 0 <= y + dy < len(self.maze[0]) and self.maze[x + dx][y + dy] != '#'] if not neighbors: break next_move = neighbors[random.randint(0, len(neighbors) - 1)] x, y = next_move path.append(next_move) return path # 创建一个5x5的迷宫 maze = Maze(5, 5) maze.create_maze() maze.print_maze() path = maze.explore_from_start() print("Path from start to end:", path) ``` 在这个例子中，我们首先初始化一个二维数组并设置起点和终点。然后创建迷宫时，从起点随机选择一个方向改变位置，直到达到终点或所有邻接位置都被访问过。`explore_from_start`方法则按照迷宫规则探索一条从起点到终点的路径。