八数码完整代码python

当然，我可以给你一个简单的八数码问题的完整代码示例，使用Python语言实现。以下是一个基于广度优先搜索算法的八数码问题求解代码：

from collections import deque

# 定义目标状态
goal_state = [[1, 2, 3],
              [8, 0, 4],
              [7, 6, 5]]

# 定义移动方向
directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]

# 定义状态类
class State:
    def __init__(self, board, moves, empty_row, empty_col):
        self.board = board
        self.moves = moves
        self.empty_row = empty_row
        self.empty_col = empty_col

    # 判断当前状态是否为目标状态
    def is_goal(self):
        return self.board == goal_state

    # 获取当前状态的邻居状态
    def get_neighbors(self):
        neighbors = []
        for direction in directions:
            new_row = self.empty_row + direction
            new_col = self.empty_col + direction
            if 0 <= new_row < 3 and 0 <= new_col < 3:
                new_board = [row[:] for row in self.board]
                new_board[self.empty_row][self.empty_col], new_board[new_row][new_col] = \
                    new_board[new_row][new_col], new_board[self.empty_row][self.empty_col]
                neighbors.append(State(new_board, self.moves + 1, new_row, new_col))
        return neighbors

# 广度优先搜索算法求解八数码问题
def solve_puzzle(initial_state):
    queue = deque()
    visited = set()
    queue.append(initial_state)
    visited.add(tuple(map(tuple, initial_state.board)))

    while queue:
        current_state = queue.popleft()
        if current_state.is_goal():
            return current_state.moves
        for neighbor in current_state.get_neighbors():
            if tuple(map(tuple, neighbor.board)) not in visited:
                queue.append(neighbor)
                visited.add(tuple(map(tuple, neighbor.board)))

    return -1  # 无解情况

# 测试代码
initial_state = State([[2, 8, 3],
                       [1, 6, 4],
                       [7, 0, 5]], 0, 2, 1)
moves = solve_puzzle(initial_state)
print("最少移动步数：", moves)

这段代码实现了一个八数码问题的求解器，使用了广度优先搜索算法来搜索最短路径。你可以根据需要修改初始状态和目标状态来测试不同的情况。