In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?
These are the letters given to you. Now you have to find out the letter that comes two to the right of the letter which is immediately to the left of the letter that comes three to the right of the letter that comes midway between the letter two to the left of the letter C and the letter immediately to the right of the letter F.
A man hijacks an aeroplane transporting both passengers(8 of them) and valuable cargo. After taking the cargo, the man demands nine parachutes, puts one of them on, and jumps, leaving the other eight behind. Why did he want eight?
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki