It's pretty hard to give up.
If you remove a part of it, you will be left with a bit.
Even if you remove another part, the bit still remains.
Remove one more and it still remains.
There are four 3-link chains. All you have to do is join them into a big 12-link chain. For joining two closed links, one of the links must be cut and placed onto the other link for closing.
How many minimum links will you have to cut to make the big chain?
A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.
If we tie a Sheep to one peg, a circled grass is been eaten by the Sheep. If we tie the Sheep to two pegs with a circle on its neck, then an eclipse is eaten out of the grass by the Sheep. If we want an eclipse then we put two pegs and then put a rope in between them and the other end of the rope is tied up on the Sheep's neck.
How should we tie the peg and the Sheep so that a square is eaten out from the garden grass? We only have one Sheep rope and the peg and the rings.
There was a blind man. He had four socks in his drawer either black or white. He opened it and took out two socks. Now the probability that it was a pair of white socks is 1/2.
Can you find out the probability that he had taken out a pair of black socks ?
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
