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?

You walk into a room where there are three primates held in their respective cages:
1) A lion who is eating the flesh of a goat.
2) An orangutan who is playing with blocks.
3) A donkey who is sitting idle.

Who is the most intelligent primate in the room?

If you go to the movies and you're paying, is it cheaper to take one friend to the movies twice, or two friends to the movies at the same time?

Can you count the number of matches in the picture below ?

I noticed one of the words in the oxford dictionary is spelled incorrectly. What about you?

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?

The Puzzle: Here is a famous prize problem that Sam Loyd issued in 1882, offering $1000 as a prize for the best answer showing how to arrange the seven figures and the eight 'dots' .4.5.6.7.8.9.0. which would add up to 82

A man is lying dead in a field where no one is around. His head is split open and his legs are disfigured. Near to him, there is an unopened package. No living organism can be found anywhere at the crime scene.

How did he die?

Two guards were on duty outside a barracks. One faced up the road to watch for anyone approaching from the North. The other looked down the road to see if anyone approached from the South. Suddenly one of them said to the other, "Why are you smiling?"

How did he know his companion was smiling?

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 ?