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?
There was once a troop of 5 elves. The 5 elves were very dedicated on finding the magical treasure of 1000 coins. However, being elves, they were super geniuses, very greedy and they did not hesitate in taking lives of other elves. The 5 elves were named Aye, Bee, Cee, Dee and Ee, ranked from high to low respectively, from Aye to Ee. One fine day, their efforts brought results and they found 1000 coins. Now they had to split it in between them as per their ranks. The lowest ranked elf has to make the proposal. If the proposal is accepted by majority, it is agreed, or the suggesting elf is killed.
A solo dice game is played. In this game, upon each turn, a normal pair of dice is rolled and the score is calculated not by adding the numbers but multiplying them.
In a particular game, the score for the second roll is five more than what was achieved in the first roll. The score for the third roll is six less than what was completed in the second roll. The score for the fourth roll is eleven more than what was achieved in the third. The score for the fifth roll is eight less than what was completed in the fourth.
Can you calculate the score for each of the five throws?
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
Rahul decided to meet Simran so he boards a local train from Bombay station. Just after the station, there is a 1km long tunnel. The train starts and is now accelerating. Rahul is a claustrophobic guy, so what is the best position for him to sit?
The king of Octopuses has servants who have six, seven or eight legs. The distinguishing characteristics of the servants is that the one with seven legs always lie but the one with either six or eight legs speak the truth always.
One day, four servants meet and converse:
The black one says, 'We have 28 legs altogether.'
The green one says, 'We have 27 legs altogether.'
The yellow one says, 'We have 26 legs altogether.'
The red one says, 'We have 25 legs altogether.'
Can you identify the colour of the servant who is speaking the truth?