What is the minimum number of moves needed for a chess knight to go from one corner of a 100x100 board to the diagonally opposite corner?
The Answer is an integer . Just put the number without any decimal places.
Topic | Difficulty | Companies |
---|---|---|
Algorithmic |
Medium
|
What is the minimum number of moves needed for a chess knight to go from one corner of a 100x100 board to the diagonally opposite corner?
The Answer is an integer . Just put the number without any decimal places.