用Python走迷宮

本文將帶領大家使用Python編寫迷宮遊戲並實現自動走迷宮的功能。

一、生成迷宮

在開始編寫代碼之前，我們需要先生成一個迷宮。迷宮可以用隨機算法生成，這裡我們使用深度優先搜索算法。

import random

# 定義迷宮大小
SIZE = 10

# 初始化迷宮
maze = [[1 for _ in range(SIZE + 2)] for _ in range(SIZE + 2)]

# 創建迷宮
def create_maze(x, y):
    maze[x][y] = 0
    directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
    random.shuffle(directions)
    for dx, dy in directions:
        nx, ny = x + dx * 2, y + dy * 2
        if 0 < nx <= SIZE and 0 < ny <= SIZE and maze[nx][ny] == 1:
            maze[x + dx][y + dy] = 0
            create_maze(nx, ny)

create_maze(1, 1)

二、顯示迷宮

接下來，我們將使用pygame模塊來顯示迷宮。

import pygame

# 定義迷宮相關參數
CELL_SIZE = 30 # 每個小格的大小
LINE_WIDTH = 2 # 迷宮邊線寬度
WIDTH = SIZE * CELL_SIZE + LINE_WIDTH # 窗口寬度
HEIGHT = SIZE * CELL_SIZE + LINE_WIDTH # 窗口高度

# 初始化pygame
pygame.init()

# 創建窗口
screen = pygame.display.set_mode((WIDTH, HEIGHT))
pygame.display.set_caption('迷宮遊戲')

# 定義顏色
WHITE = (255, 255, 255)
BLACK = (0, 0, 0)
GREEN = (0, 255, 0)

# 繪製迷宮
def draw_maze():
    screen.fill(WHITE)
    for i in range(1, SIZE + 1):
        for j in range(1, SIZE + 1):
            if maze[i][j] == 1:
                pygame.draw.rect(screen, BLACK, (CELL_SIZE * (j - 1), CELL_SIZE * (i - 1), CELL_SIZE, CELL_SIZE))
    pygame.display.update()

draw_maze()

三、尋路策略

我們將使用BFS算法作為尋路策略來自動走迷宮。

# 定義起點和終點
start = (1, 1)
end = (SIZE, SIZE)

# 初始化BFS算法
queue = [start]
path = {start: None}

# BFS尋路
while queue:
    current = queue.pop(0)
    if current == end:
        break
    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:
        next_pos = (current[0] + dx, current[1] + dy)
        if 0 < next_pos[0] <= SIZE and 0 < next_pos[1] <= SIZE and maze[next_pos[0]][next_pos[1]] == 0 and next_pos not in path:
            queue.append(next_pos)
            path[next_pos] = current

# 標記路徑
pos = end
while pos != start:
    pos = path[pos]
    maze[pos[0]][pos[1]] = 2

draw_maze()

四、自動走迷宮

最後，我們將實現自動走迷宮的功能。

# 自動走迷宮
pos = start
while pos != end:
    for event in pygame.event.get():
        if event.type == pygame.QUIT:
            pygame.quit()
            quit()
    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:
        next_pos = (pos[0] + dx, pos[1] + dy)
        if 0 < next_pos[0] <= SIZE and 0 < next_pos[1] <= SIZE and maze[next_pos[0]][next_pos[1]] == 2:
            pos = next_pos
            maze[pos[0]][pos[1]] = 3
            draw_maze()
            pygame.time.wait(100)

# 顯示完成信息
font = pygame.font.SysFont(None, 60)
text = font.render('達到終點', True, GREEN)
screen.blit(text, (WIDTH // 2 - text.get_rect().width // 2, HEIGHT // 2 - text.get_rect().height // 2))
pygame.display.update()
pygame.time.wait(2000)

# 退出遊戲
pygame.quit()
quit()

通過上面的代碼，我們已經可以自動走通迷宮了。完整代碼如下：

import random
import pygame

# 定義迷宮大小
SIZE = 10

# 初始化迷宮
maze = [[1 for _ in range(SIZE + 2)] for _ in range(SIZE + 2)]

# 創建迷宮
def create_maze(x, y):
    maze[x][y] = 0
    directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
    random.shuffle(directions)
    for dx, dy in directions:
        nx, ny = x + dx * 2, y + dy * 2
        if 0 < nx <= SIZE and 0 < ny <= SIZE and maze[nx][ny] == 1:
            maze[x + dx][y + dy] = 0
            create_maze(nx, ny)

create_maze(1, 1)

# 定義迷宮相關參數
CELL_SIZE = 30 # 每個小格的大小
LINE_WIDTH = 2 # 迷宮邊線寬度
WIDTH = SIZE * CELL_SIZE + LINE_WIDTH # 窗口寬度
HEIGHT = SIZE * CELL_SIZE + LINE_WIDTH # 窗口高度

# 初始化pygame
pygame.init()

# 創建窗口
screen = pygame.display.set_mode((WIDTH, HEIGHT))
pygame.display.set_caption('迷宮遊戲')

# 定義顏色
WHITE = (255, 255, 255)
BLACK = (0, 0, 0)
GREEN = (0, 255, 0)

# 繪製迷宮
def draw_maze():
    screen.fill(WHITE)
    for i in range(1, SIZE + 1):
        for j in range(1, SIZE + 1):
            if maze[i][j] == 1:
                pygame.draw.rect(screen, BLACK, (CELL_SIZE * (j - 1), CELL_SIZE * (i - 1), CELL_SIZE, CELL_SIZE))
            elif maze[i][j] == 2:
                pygame.draw.circle(screen, GREEN, (CELL_SIZE * (j - 1) + CELL_SIZE // 2, CELL_SIZE * (i - 1) + CELL_SIZE // 2), CELL_SIZE // 4)
            elif maze[i][j] == 3:
                pygame.draw.circle(screen, GREEN, (CELL_SIZE * (j - 1) + CELL_SIZE // 2, CELL_SIZE * (i - 1) + CELL_SIZE // 2), CELL_SIZE // 2)
    pygame.display.update()

draw_maze()

# 定義起點和終點
start = (1, 1)
end = (SIZE, SIZE)

# 初始化BFS算法
queue = [start]
path = {start: None}

# BFS尋路
while queue:
    current = queue.pop(0)
    if current == end:
        break
    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:
        next_pos = (current[0] + dx, current[1] + dy)
        if 0 < next_pos[0] <= SIZE and 0 < next_pos[1] <= SIZE and maze[next_pos[0]][next_pos[1]] == 0 and next_pos not in path:
            queue.append(next_pos)
            path[next_pos] = current

# 標記路徑
pos = end
while pos != start:
    pos = path[pos]
    maze[pos[0]][pos[1]] = 2

# 自動走迷宮
pos = start
while pos != end:
    for event in pygame.event.get():
        if event.type == pygame.QUIT:
            pygame.quit()
            quit()
    for dx, dy in [(1, 0), (-1, 0), (0, 1), (0, -1)]:
        next_pos = (pos[0] + dx, pos[1] + dy)
        if 0 < next_pos[0] <= SIZE and 0 < next_pos[1] <= SIZE and maze[next_pos[0]][next_pos[1]] == 2:
            pos = next_pos
            maze[pos[0]][pos[1]] = 3
            draw_maze()
            pygame.time.wait(100)

# 顯示完成信息
font = pygame.font.SysFont(None, 60)
text = font.render('達到終點', True, GREEN)
screen.blit(text, (WIDTH // 2 - text.get_rect().width // 2, HEIGHT // 2 - text.get_rect().height // 2))
pygame.display.update()
pygame.time.wait(2000)

# 退出遊戲
pygame.quit()
quit()