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?
Can you identify the famous TV character from the rebus below?
A deaf and mute man goes to the train station. Tickets for the train are 50 cents each. The man goes to the ticket booth and hands the man inside just a dollar. The man in the booth hands him two tickets.
How did the man in the booth know to give him two tickets without even looking at him?
In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?
Can you find out a way through which you can make five squares out of the given figure by moving just six match sticks?
