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?

A boy was locked in a room by some robbers. All that is in the room is a piano, a calendar, and a bed. The room is locked from the outside. What does he eat, drink, and how does he escape and get out?

In a competitive exam, each correct answer could win you 10 points and each wrong answer could lose you 5 points. You sat in the exam and answered all the 20 questions, which were given in the exam.
When you checked the result, you scored 125 marks on the test.

Can you calculate how many answers given by you were wrong?

There are four 3-link chains. All you have to do is join them into a big 12-link chain. For joining two closed links, one of the links must be cut and placed onto the other link for closing.

How many minimum links will you have to cut to make the big chain?

An ape is trying to climb on a pole that is 60 feet high. Due to the slippery surface, the ape climbs 3 feet in a minute only to slip back 2 feet.

How much time do you think the monkey will take to reach the top of the pole?

What does below Rebus say?

XLR8

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?

You have a 12 liters jug full of water. You have two empty 8 liters and 5 liters jug. How can you divide the water into two equal parts using these jugs?

There is a straight highway. Four different villages lie on that highway. The distance between them is different. The third village is 60km away from the first village; the fourth is 40 km away from the second; the third is 10 km near to the fourth that it is to the second.

Can you calculate the distance between the fourth and the first village ?

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?