In a boat, the father of a sailor's son is sitting with the son of the sailor. However, the sailor is not present on the boat.

Can this even be possible?

Can you solve the below tricky visual equation?

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

A man is trapped in a room. The room has only two possible exits doors. Through the first door there is a room constructed from magnifying glass. The blazing hot sun instantly fries anything or anyone that enters. Through the second door there is a fire-breathing dragon. How does the man escape?

Can you solve this amazing hard number series problem?
7, 8, 10, 12, 16, 18 ?

In a fruit store, there was a unique weighing machine that was made to weigh only cherries and strawberries as they were priced the same.

Other fruits like watermelons or mango had different machines as they were expensive.

A man successfully buys watermelons at the price of cherries. How?

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?

The picture shows the dice results in each couple of throws. If they are actually following a pattern, can you find out the missing one?

You have two bottles of pills marked with labels A and B. The pills are identical. The doctor has asked you to take one A pill and one B pill daily. You cant take more or less than that.

While taking out the pills one day, you took out one pill from A and by mistake took out two from B. You have no idea which pill is which now.

You cant throw away the expensive pills. What will you do now?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?