John and his team plan to rob a safe. They got just one chance to break the code else the local police will be informed. Below are clues:
A) Exactly one number is perfectly placed: 9 8 1
B) Everything is incorrect: 9 2 4
C) Two numbers are part of the code of the safe but are wrongly placed: 0 9 3
D) One number is part of the code of the safe but is wrongly placed: 1 4 7
E) One number is part of the code of the safe but is wrongly placed: 7 8 3
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 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?
You walk into a room where there are three primates held in their respective cages:
1) A lion who is eating the flesh of a goat.
2) An orangutan who is playing with blocks.
3) A donkey who is sitting idle.
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