top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

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

0 votes
581 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 by Rajni

Share this puzzle
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer (Check Answer ▼)





Similar Puzzles
0 votes
What is the minimum number of boxes needed to satisfy the following conditions?

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.
0 votes
What is the minimum number of moves for White to checkmate the Black king in the given image?

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?
enter image description here

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

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?

0 votes
What is the minimum number of sticks needed to add three more equilateral triangles to it?

You are given an equilateral triangle of three matchsticks like given figure. What is the minimum number of sticks needed to add three more equilateral triangles to it?

enter image description here

0 votes
Find, with proof, the minimum number of moves so that all glasses are turned upside down.

Four glasses are in a row right side up.
enter image description here

In each move, you must invert exactly 3 different glasses. Invert means to flip a glass, so a right side up glass it turned upside down, and vice versa. Find, with proof, the minimum number of moves so that all glasses are turned upside down.

What if there are n glasses, and you have to invert n – 1 glasses at a time? For which n is there a solution, and what is the minimum number of moves?

...