数字华容道3x3自动复原python

这是一个自动复原数字华容道3x3的Python程序：

import copy

def get_blank_pos(puzzle):
    for i in range(3):
        for j in range(3):
            if puzzle[i][j] == 0:
                return (i, j)

def move(puzzle, direction):
    i, j = get_blank_pos(puzzle)
    new_puzzle = copy.deepcopy(puzzle)
    if direction == 'up':
        new_puzzle[i][j], new_puzzle[i-1][j] = new_puzzle[i-1][j], new_puzzle[i][j]
    elif direction == 'down':
        new_puzzle[i][j], new_puzzle[i+1][j] = new_puzzle[i+1][j], new_puzzle[i][j]
    elif direction == 'left':
        new_puzzle[i][j], new_puzzle[i][j-1] = new_puzzle[i][j-1], new_puzzle[i][j]
    elif direction == 'right':
        new_puzzle[i][j], new_puzzle[i][j+1] = new_puzzle[i][j+1], new_puzzle[i][j]
    return new_puzzle

def is_solved(puzzle):
    return puzzle == [[1, 2, 3], [4, 5, 6], [7, 8, 0]]

def solve(puzzle, moves=[]):
    if is_solved(puzzle):
        return moves
    i, j = get_blank_pos(puzzle)
    if i > 0:
        up = move(puzzle, 'up')
        if up not in moves:
            up_moves = moves + ['up']
            up_solution = solve(up, up_moves)
            if up_solution:
                return up_solution
    if i < 2:
        down = move(puzzle, 'down')
        if down not in moves:
            down_moves = moves + ['down']
            down_solution = solve(down, down_moves)
            if down_solution:
                return down_solution
    if j > 0:
        left = move(puzzle, 'left')
        if left not in moves:
            left_moves = moves + ['left']
            left_solution = solve(left, left_moves)
            if left_solution:
                return left_solution
    if j < 2:
        right = move(puzzle, 'right')
        if right not in moves:
            right_moves = moves + ['right']
            right_solution = solve(right, right_moves)
            if right_solution:
                return right_solution

puzzle = [[2, 3, 6], [1, 5, 0], [4, 7, 8]]
solution = solve(puzzle)
print(solution)

该程序使用深度优先搜索算法来寻找数字华容道3x3的解决方案。它将从当前状态开始，并尝试将空格向上、下、左或右移动，并递归地搜索每个可能的下一步状态，直到找到一个解决方案或搜索完所有可能的状态。如果找到解决方案，则返回移动序列。如果没有找到解决方案，则返回None。

在程序中，get_blank_pos函数用于获取空格的位置。move函数用于移动数字块。is_solved函数用于检查数字华容道是否已经被解决。solve函数是程序的主要部分，它递归地搜索数字华容道的状态，并返回移动序列。最后，程序定义了一个初始数字华容道的状态，并调用solve函数来寻找解决方案。