A ‘long knight’ moves on a square grid.
A single move, as shown, consists of moving three squares in one direction (horizontally or vertically) and then one square at right angles to the first direction.
What is the smallest number of moves a long knight requires to go from one corner of a square board to the diagonally opposite corner?
Select one option, then click Submit.
4
5
6
7
8
Select an option, then submit.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
Junior Mathematical Challenge 2013 (2013)
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →Junior Mathematical Challenge 2013 (2013)