Four cars come to a four-way stop, each coming from a different direction. They can’t decide who got there first, so they all go forward at the same time. All 4 cars go, but none crash into each other. How is this possible?
What does man love more than life, and hate more than death or mortal strife; that which satisfied men want; the poor have, and the rich require; the miser spends, the spendthrift saves, and all men carry to their graves?
A woman lives in a skyscraper thirty-six floors high and is served by several elevators which stop at each floor going up and down. Each morning she leaves her apartment and goes to one of the elevators. Whichever one she takes is three times more likely to be going up than down. Why?
You have a 12 liters jug full of water. You have two empty 8 liters and 5 liters jug. How can you divide the water into two equal parts using these jugs?
A river should be crossed by a father, a mother and their two sons and two daughters.
There are some rules that should be followed while crossing the river. There can be only two people in the raft while crossing. The daughters cannot be with their father unless there is the presence of the mother. The sons cannot be with their mothers unless the father is present. Unless the guard is on the board, the criminals cannot be with any of the family members. Only the adults like the father, the guard, and the mother knows to use the raft.
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
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
