Python利用遗传算法探索迷宫出路实例深究

# 0 表示可通行的路径
# 1 表示墙壁
# S 表示起点
# E 表示终点
maze = [
    [1, 1, 1, 1, 1, 1, 1],
    [1, 0, 0, 0, 0, 0, 1],
    [1, 0, 1, 1, 1, 0, 1],
    [1, 0, 0, 0, 0, 0, 1],
    [1, 1, 1, 1, 1, 0, 1],
    [1, 'S', 0, 0, 0, 0, 1],
    [1, 1, 1, 1, 1, 1, 1]
]

path = "DDRURULDL"

def fitness_function(path, maze):
    # 获取起点坐标
    start = find_starting_point(maze)
    x, y = start[0], start[1]
    # 按路径移动
    for move in path:
        if move == 'D':
            x += 1
        elif move == 'U':
            x -= 1
        elif move == 'L':
            y -= 1
        elif move == 'R':
            y += 1
        # 检查是否越界或撞墙
        if x < 0 or y < 0 or x >= len(maze) or y >= len(maze[0]) or maze[x][y] == 1:
            return 0  # 无效路径，返回适应度为0
        # 到达终点
        if maze[x][y] == 'E':
            return 1  # 成功到达终点，返回适应度为1
    return 0  # 路径未到达终点，返回适应度为0

def selection(population, maze):
    # 根据适应度函数对路径进行排序或随机选择
    # 选择较优秀的路径作为父代
    # 返回父代路径集合
    pass

def crossover(parent1, parent2):
    # 对父代路径进行交叉操作
    # 产生子代路径
    # 返回子代路径
    pass

def mutation(path):
    # 对路径进行变异操作
    # 产生新的路径
    # 返回变异后的路径
    pass

def solve_maze(maze, population_size, generations):
    population = generate_initial_population(population_size, maze)  # 生成初始种群
    for generation in range(generations):
        parents = selection(population, maze)  # 选择父代
        new_population = []
        for i in range(0, len(parents), 2):
            parent1 = parents[i]
            parent2 = parents[i + 1] if i + 1 < len(parents) else parents[i]
            child = crossover(parent1, parent2)  # 交叉操作
            if random_chance_of_mutation():  # 变异操作
                child = mutation(child)
            new_population.append(child)
        population = new_population  # 更新种群
        # 找到最优路径
        best_path = max(population, key=lambda path: fitness_function(path, maze))
        if fitness_function(best_path, maze) == 1:  # 如果找到最佳路径
            return best_path
    return None  # 未找到最佳路径

import matplotlib.pyplot as plt
def display_solution(maze, best_path):
    # 标记迷宫
    for i in range(len(maze)):
        for j in range(len(maze[0])):
            if maze[i][j] == 1:  # 墙壁
                plt.fill([j, j+1, j+1, j], [len(maze) - i, len(maze) - i, len(maze) - i + 1, len(maze) - i + 1], 'black')
    # 标记路径
    x, y = find_starting_point(maze)
    for move in best_path:
        if move == 'D':
            x += 1
        elif move == 'U':
            x -= 1
        elif move == 'L':
            y -= 1
        elif move == 'R':
            y += 1
        plt.fill([y, y+1, y+1, y], [len(maze) - x, len(maze) - x, len(maze) - x + 1, len(maze) - x + 1], 'green')
    plt.show()