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?
I went to the bookshop and spent one-half of the money that was in my purse.
When I came out, I found that I had as many cents as I had dollars and half as many dollars as I had cents when I went in. Find the money in my purse when I entered the store.
You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).
Its something that each of us devours,
Not just us but birds, beats, trees, and flowers,
Frets iron and nibbles steel,
Toil hard stones to meal,
Exterminates king, collapse town,
And blows the mountains down.
In a kingdom, King George did not allow any citizen to visit the world outside. Also, only a person with proper paperwork was allowed to enter or he was sent back. A wooden bridge was what connected the kingdom to the world. The king had appointed a sharpshooter who would check the every five minutes on the bridge to check. After checking, he would go back to his hut and return exactly after five minutes again. The bridge took 9 minutes to cross.
A merchant was able to escape the kingdom without harming the shooter. How?
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