我正在使用回溯来解决骑士旅行问题，但是我没有得到想要的结果。

def is_valid_move(x, y, board):
    return 0 <= x < len(board) and 0 <= y < len(board) and board[x][y] == -1

def solve_knight_tour(board, move_x, move_y, x, y, move_count):
    if move_count == len(board) * len(board):
        return True

    for i in range(8):
        next_x = x + move_x[i]
        next_y = y + move_y[i]
        if is_valid_move(next_x, next_y, board):
            board[next_x][next_y] = move_count
            if solve_knight_tour(board, move_x, move_y, next_x, next_y, move_count + 1):
                return True
            board[next_x][next_y] = -1  # Backtracking

    return False

def knight_tour(n):
    board = [[-1 for _ in range(n)] for _ in range(n)]
    move_x = [2, 1, -1, -2, -2, -1, 1, 2]
    move_y = [1, 2, 2, 1, -1, -2, -2, -1]

    board[0][0] = 0
    if not solve_knight_tour(board, move_x, move_y, 0, 0, 1):
        print("Solution does not exist")
    else:
        for row in board:
            print(row)

# Example usage:
knight_tour(5)