Sweet & very intelligent katty has 8 puppets(Jane Bird Barbie Angel Colleen Nora Lass Missy).
All puppets are of different size. She arrange all puppets to face towards the guest and tell the guess the following clues :
* Jane has three puppets bigger on its left side
* Bird has two puppets smaller on its left side
* Barbie has one puppet bigger on its right side
* Angel has two puppets smaller on its right side
* Colleen has one puppet bigger on its left side
* Nora has one puppet smaller on its left side
* Lass has four puppets bigger on its right side
* Missy has three puppets smaller on its right side
Also some puppets are inside the bigger puppets.
Assuming you are the guest , can you tell the katty how the puppets are arranged ?
Two fathers and two sons went fishing one day. They were there the whole day and only caught 3 fish. One father said, that is enough for all of us, we will have one each. How can this be possible?
A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
One night, a man runs away from home. He turns left and keeps running. After some time he turns left again and keeps running. Later, he turns left one more time and runs back home—but when he gets home, he finds a man in a mask. Who was the man in the mask?
How many people must be gathered together in a room, before you can be certain that there is a greater than 50/50 chance that at least two of them have the same birthday?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki