MathDB
Knight moving from one corner to the opposite

Source: Baltic Way 1999

December 23, 2010
inductionfloor functionceiling functioncombinatorics proposedcombinatorics

Problem Statement

What is the least number of moves it takes a knight to get from one corner of an n×nn\times n chessboard, where n≥4n\ge 4, to the diagonally opposite corner?
Back to ProblemsView on AoPS