Chess Knights' Puzzle

[The_Plank]

What is the smallest number of moves it takes for a knight to travel from one corner of a chessboard to the diagonally opposite corner?

[Prudie]

5

[AlwaysConfused]

Not sure, but it must be a simple mathematical equation. This may be of help http://www.mathrecreation.com/2011/03/knight-moves.html

[Prudie]

Sorry ignore my answer, I scribbled one column too many.

[Ellipsis]

Six.

[Prudie]

Yes I make it 6 now

[The_Plank]

Thanks very much

[Jonathan-Joe]

Analysis here http://nrich.maths.org/1317