# What is the minimum number of moves needed to go to the diagonally opposite corner?

545 views

A knight is in one corner of a 100x100 chessboard. What is the minimum number of moves needed to go to the diagonally opposite corner?

posted Jun 26, 2014

200 Pawn can move only right,left or forward.

Similar Puzzles

What is the minimum number of boxes needed to satisfy the following conditions?

• Each box contains distinct positive integer(s) less than 1001.
• All the boxes put together contain all the positive integers less than 1001.
• No box contains a number that is a multiple of another number in the same box.

See the following chess case and it’s White's turn to move. If both White and Black play optimally, what is the minimum number of moves for White to checkmate the Black king?

You have 2017 cards numbered 1, 2, 3, ..., 2017 in the same order. In each move, you can change the order of two adjacent cards. (For example, if you had only four cards arranged as 1234, what you could achieve in one move would be 2134, 1324, or 1243.)

What is the minimum number of moves required for the above cards to be arranged backwards as 2017, 2016, ..., 2, 1?