BALTIC-WAY 1999 Problem 6
- Answer
What is the least number of moves it takes a knight to get from one corner of an chessboard, where , to the diagonally opposite corner?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
2 \cdot\left\lfloor\frac{n+1}{3}\right\rfloor
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.