6

Part of 1999 Baltic Way

Problems(1)

Knight moving from one corner to the opposite

Source: Baltic Way 1999

What is the least number of moves it takes a knight to get from one corner of an

n\times n

chessboard, where

n\ge 4

, to the diagonally opposite corner?

inductionfloor functionceiling functioncombinatorics proposedcombinatorics