MathNet 1999 — Part 01 Question 16

What is the least number of moves it takes a knight to get from one corner of an $n \times n$ chessboard, where $n \geqslant 4$, to the diagonally opposite corner?