As we know that white starts the game of chess. Can you find the scenario shown in the picture below is possible when all the white pieces are at the original place while the black pawn is not as in the below picture?

What does this rebus mean?

O
N
C
E
TIME

What is more useful when it is broken?

What can go through glass without breaking it?

A man who was outside in the rain without an umbrella or hat didn’t get a single hair on his head wet. Why?

You are in a room that has three switches and a closed door. The switches control three light bulbs on the other side of the door. Once you open the door, you may never touch the switches again. How can you definitively tell which switch is connected to each of the light bulbs?

10 people came into a hotel with 9 rooms and each guest wanted his own room. The bellboy solved this problem.
He asked the tenth guest to wait for a little with the first guest in room number 1. So in the first room, there were two people. The bellboy took the third guest to room number 2, the fourth to number 3, ..., and the ninth guest to room number 8. Then he returned to room number 1 and took the tenth guest to room number 9, still vacant.
How can everybody have his own room?

There is an ancient kingdom where every married woman keeps information regarding the fidelity of other men. However, what they don't know is the fidelity of their own husbands. Also, there is an ancient belief that they don't tell each other about the fidelity of their husbands.

On a certain day, the queen of the kingdom declares that she has identified at least one unfaithful man in the kingdom. She allows the wives to identify and gives them authority to kill their husbands if they are unfaithful at midnight.

How will the wives manage it?

In The 1st month of this year(the year 2013), I noticed that the date 13-1-13 (13 January 2013) is special.

This date is special as:

Date * Month = Year.

Can you figure out which year of this century has a maximum number of such dates?

What is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?