In a given version of chess, no piece can capture another piece. Instead, each piece is on a mission. In the scenario shown in the figure on the left, the knight is on a mission to the diagonally opposite square marked by X. Assuming that no other piece moves, what is the minimum number of moves it will take the knight to reach there? (Note: In chess, the knight moves as shown in the figure on the right. The knight cannot land on any square that has a pawn, but can jump over it.)