top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration Why to Join

    Get Free Puzzle Updates

Facebook Login
Site Registration

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

0 votes

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

Looking for solution? Promote on:
Facebook Share Button Twitter Share Button Google+ Share Button LinkedIn Share Button Multiple Social Share Button

Similar Puzzles
+1 vote

enter image description here

There are 13 caves arranged in a circle. There is a thief hiding in one of the caves. Each day the the thief can move to any one of of the caves that is adjacent to the cave in which he was staying the previous day. And each day, you are allowed to enter any two caves of your choice.

What is the minimum number of days to guarantee in which you can catch the thief?

Note: Thief may or may not move to adjacent cave. You can check any two caves, not necessarily be adjacent. If thief and you exchange your caves, you will surely cross at some point, and you can catch the thief immediately.

+1 vote

You have 64 numbers. What is the least number of comparison needed to find the 2nd smallest out of them?

0 votes

You've got 27 coins, each of them is 10g, except for 1. The 1 different coin is 9g or 11g (heavier, or lighter by 1g). You should use balance scale that compares what's in the two pans. You can get the answer by just comparing groups of coins.
What is the minimum number weighings that can always guarantee to determine the different coin.

0 votes

Out of 100 women surveyed leaving Shoppers Stop, 83 had a white bag, 77 had black shoes, 62 carried an umbrella and 95 wore a ring.
What is the minimum number of women who must have had all four items?

Contact Us
+91 9880187415
#470/147, 3rd Floor, 5th Main,
HSR Layout Sector 7,
Bangalore - 560102,
Karnataka INDIA.