Quizzes & Puzzles35 mins ago
Chess Knights' Puzzle
7 Answers
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?
Answers
Sorry ignore my answer, I scribbled one column too many.
15:48 Fri 29th May 2015
Not sure, but it must be a simple mathematical equation. This may be of help http://www.mathrecreation.com/2011/03/knight-moves.html