Donate SIGN UP

Chess Knights' Puzzle

Avatar Image
The_Plank | 15:42 Fri 29th May 2015 | Quizzes & Puzzles
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?
Gravatar

Answers

1 to 7 of 7rss feed

Avatar Image
Sorry ignore my answer, I scribbled one column too many.
15:48 Fri 29th May 2015
5
Not sure, but it must be a simple mathematical equation. This may be of help http://www.mathrecreation.com/2011/03/knight-moves.html
Sorry ignore my answer, I scribbled one column too many.
Six.
Yes I make it 6 now
Question Author
Thanks very much

1 to 7 of 7rss feed

Do you know the answer?

Chess Knights' Puzzle

Answer Question >>

Related Questions