You have an empty wine bottle with a cork that has been secured at the top in a normal way. There is a metal ring inside the bottle that is suspended by a string.
How can you make the metal ring drop to the bottom if you are not allowed to touch anything - not the bottle, not the cork, not the thread and not the ring?
You are trapped in a room with two doors. One leads to certain death and the other leads to freedom. You don't know which is which.
There are two robots guarding the doors. They will let you choose one door but upon doing so you must go through it.
You can, however, ask one robot one question. The problem is one robot always tells the truth, the other always lies and you don't know which is which.
What is the question you ask?
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?
A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?
You are a cab driver who pools passengers. You pick 3 people from a destination and drop 1 after an hour. 2 people climb aboard at the same time and you drop 3 at the next destination. After some time, you pick 2 passengers only to drop 1 after a short distance where 3 more passengers climb up the cab. You leave the rest of the passengers one by one to their destination and then come back home.
Take number 1000 and then add 20 to it.
Now add 1000 one more time.
Now add 30.
Now add 1000 one more time.
Now add 40.
Now add 1000 one more time.
Now add 10.
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
