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?
During an experiment, a guy throws a bouncy ball from a 100 feet tall building. The ball has a specific characteristic. Every time it hits the ground, it bounces up halfway.
How many bounces do you think the ball will make before it comes to a stop ?
In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?
I am first found in caves, now prolific online; I am a depiction, a drawing, a symbol, or sign. I will convey whichever mood you could wish; or for that matter, a fist, flask, or fish. What am I?
Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.
On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.