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 girl was sitting in her hotel room when she heard a knock on the door. She opened the door and found that a man was standing outside. The man said, "Oh! I am really sorry, I thought this was my room." He then walked through the corridor to the elevator. The girl did not know the man. She closed her door and called security asking them to apprehend the man. What made her suspicious of that man? He might have been genuinely mistaken.
A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.
For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.
Can you find out how much did the youngest one receive?
A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?
On the dull night when the blonde was dozing, she heard an odd clamour and she saw that there was a bizarre man with a gun simply outside her home. So she raced to the telephone to call the police, however, she can't dial 911. Why?
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