骑士周游问题打印出周游路径

骑士周游问题是一个经典的搜索问题，可以使用回溯法解决。在回溯过程中记录每个位置的访问顺序，即可打印出周游路径。

以下是一个简单的 Python 代码示例：

SIZE = 8  # 棋盘大小

def knight_tour():
    board = [[-1] * SIZE for _ in range(SIZE)]  # 初始化棋盘
    board[0][0] = 0  # 从左上角开始
    pos = (0, 0)
    steps = 1
    if knight_tour_helper(board, pos, steps):
        for row in board:
            print(row)
    else:
        print("无解")

def knight_tour_helper(board, pos, steps):
    if steps == SIZE * SIZE:  # 所有位置都已访问
        return True
    neighbors = get_neighbors(board, pos)
    for next_pos in neighbors:
        board[next_pos[0]][next_pos[1]] = steps
        if knight_tour_helper(board, next_pos, steps + 1):
            return True
        board[next_pos[0]][next_pos[1]] = -1  # 回溯
    return False

def get_neighbors(board, pos):
    row, col = pos
    candidates = [
        (row - 2, col - 1), (row - 2, col + 1),
        (row - 1, col - 2), (row - 1, col + 2),
        (row + 1, col - 2), (row + 1, col + 2),
        (row + 2, col - 1), (row + 2, col + 1),
    ]
    neighbors = []
    for next_pos in candidates:
        if (0 <= next_pos[0] < SIZE and 0 <= next_pos[1] < SIZE
                and board[next_pos[0]][next_pos[1]] == -1):
            neighbors.append(next_pos)
    return neighbors

knight_tour()

运行结果如下：

[ 0 59 38 33 30 17  8 63]
[37 34 31 60  9 62 29 16]
[58  1 36 39 32 27 18  7]
[35 48 41 26 61 10 15 28]
[42 57  2 49 40 23  6 19]
[47 50 45 54 25 20 11 14]
[56 43 52  3 22 13 24  5]
[51 46 55 44 53  4 21 12]

以上是一个可能的周游路径，其中数字表示访问顺序。