A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?

In a secret society, a buried chamber can be accessed only via a secret password. The password is seven characters long and comprises of just letters and numbers.

You find a code that can help you in cracking the password. The code says "You force heaven to be empty".

Can you deduce the password from that?

A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?

What does man love more than life, and hate more than death or mortal strife; that which satisfied men want; the poor have, and the rich require; the miser spends, the spendthrift saves, and all men carry to their graves?

I can write cow in 13 letters.

Can You?

What is so fragile that saying its name breaks it?

Find three numbers such that When we multiply three numbers, we will get the prime numbers. The difference between the second and the first number is equal to the third and second.

Usually, a boxing match consists of twelve rounds. In a particular friendly match between two heavyweights, the match was finished in the ninth round itself as one of the boxers knocked out the other one.

But, in that fight, no man threw even a single punch.

How can this be possible?

John and Jacob are playing bets. John gives $10 to Jacob and Jacob deals four cards out of a normal 52-card deck which are chosen by him completely randomly. Jacob keeps them facing down takes the first card and shows it to John. John has a choice of either keeping it or looking at the second card. When the second card is shown to him, he again has the choice of keeping or looking at the third which is followed by the third card as well; only if he does not want the third card, he will have to keep the fourth card.

If the card that John is choosing is n, Jacob will give it to him. Then the cards will be shuffled and the game will be played repeatedly. Now you might think that it all depends on chance, but John has come up with a strategy that will help him turn the favor in his odds.

Can you deduce the strategy of John?

This is a game of Tic-Tac-Toe which you all might have played innumerable times. Here, we are playing with the black and white markers instead. Also, there is a bit change to the rules. The changed rules allow you to play just three times. After the three markers are put by each of the players, you can only slide your marker into an empty square that shares a common wall with the square that the marker is leaving. You can refer to the figure given. If this is the position of the game, the white's next move would be from 6 to 3. Now, whatever the black one does, the white one will move his marker from 5 to 2 and he will have a three in a row. What you have to decide is if both of the players are using a perfect strategy, will the white player (who plays first) always win? Or it will be the black one who will win always? Or every game will be a draw?