There are two dice with empty faces in front of you and a marker. You can mark any number on each of the faces of the two dice, but you have to display all 31 days of the month using the two of them.
Which numbers will you mark on which dice so that you can easily depict all the dates of the month?
See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
This is a famous paradox which has caused a great deal of argument and disbelief from many who cannot accept the correct answer. Four balls are placed in a hat. One is white, one is blue and the other two are red. The bag is shaken and someone draws two balls from the hat. He looks at the two balls and announces that at least one of them is red. What are the chances that the other ball he has drawn out is also red?
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?