A man was convicted of a minor offence in Akbar court. Akbar decided to give him a chance. He asked him to give a statement. If the statement is true, he will be killed by lions and if it is false, he will be killed by trampling of wild elephants.
The convicted person requested help from Birbal and since the crime was not a big one, Birbal decided to help him. Whatever Birbal suggested impressed Kabir and he let the convicted person go.
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
One day, all the courtiers from Akbar's court were gathered in the assembly hall when one of them told the Emperor that all his valuables had been stolen by a thief the previous night.
This shocked the Emperor to his core as the place where that courter stayed was the most secured in the kingdom. The Emperor thought that it is not at all possible for an outsider to enter into the courtier's house and steal the valuables. Only another courtier could commit this crime. He quickly called Birbal to identify the thief.
Birbal thought for a while and successfully solved the mystery by identifying the thief in just one statement.
What did Birbal say?
When Jack was six years old he hammered a nail into his favourite tree to mark his height. Ten years later at age sixteen, Jack returned to see how much higher the nail was. If the tree grew by five centimetres each year, how much higher would the nail be?
In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.
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