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 find the hidden animal in the picture below?

using four eights (8) and a one (1) and one mathematical symbol , create the number 100

You may enter, but you may not come in. I have space, but no room. I have keys, but open no lock. What am I?

Can you solve the below rebus?

A pack of cards has 40 cards. You are blindfolded. Out of 40, 25 cards are facing down while 15 are facing up. You have been asked to divide this pack of cards into two decks - so that each deck contains an equal number of face-up cards. Remember, you are blindfolded.

How will you do it?

There was a minor accident with a doctor's son but the doctor noticed no major injury. After the treatment, the father of that doctors son is sitting with the son of the doctor without the doctor being in the room.

How can this be possible?

At a Society election for president, precisely 963 votes were cast.
There is a total of 4 candidates that participate in the election.

The winning candidate exceeds the opponents by 53, 79 and 105 votes.

How many votes do each candidate gets?

Solve the alphametic puzzle by replacing the alphabet with the number.

S T O R M +
S O L E S
=========
T O W E L
=========

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?