Cut the Chain

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?




Similar Riddles

There are three boxes which are labeled as Rs100, Rs150, and Rs200. One box contains two notes of Rs. 50. The second box contains one note of Rs50 and one note of Rs100 The third box contains two Rs. 100 notes. All boxes are labeled incorrectly.

What is the minimum number of boxes you must check in order to label all boxes correctly?

Asked by Neha on 02 Feb 2021


It is Secret Agent Bond Girl Friend's birthday but he is on a secret mission

Mr Bond has a secret device by which he can only use the below words for sending the message.

Dumbo, Nazi, Carrot, Ronda, Zambia, Racing, TinTin, Seou, Zareeba, Laltain, Saphire, Tar, Orphan, Audition, Biscotti.

Mr Bond sends the following message to her girlfriend:
Carrot Dumbo Nazi Racing Ronda Zambia TinTin Seou Laltain Zareeba Tar Biscotti Orphan Audition Snake

What does Mr. Bond's Message say?

Asked by Neha on 12 Apr 2026

A large water tank has two inlet pipes (a large one and a small one) and one outlet pipe. It takes 3 hours to fill the tank with the large inlet pipe. On the other hand, it takes 6 hours to fill the tank with the small inlet pipe. The outlet pipe allows the full tank to be emptied in 9 hours.

What fraction of the tank (initially empty) will be filled in 0.64 hours if all three pipes are in operation? Give your answer to two decimal places (e.g., 0.25, 0.5, or 0.75).

Asked by Neha on 08 Jan 2026


All of the flowers I have are orchids except two. All of the flowers I have are hibiscuses except two. All of the flowers I have are roses except two.

Can you tell me how many flowers I have?

Asked by Neha on 28 Feb 2025

Find the mistake in the below maths equations

A = 2
A(A-1) = 2(A-1)
A2-A = 2A-2
A2-2A = A-2
A(A-2) = A-2
A = 1

Asked by Neha on 15 Oct 2024

15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?

15 Cave Riddle

Asked by Neha on 29 Jul 2024


If I put in one bird per cage, I have one bird too many. If I put in two bird per cage, I have one cage too many. How many cages and birds do I have?

Asked by Neha on 25 Apr 2024

I am a five-letter word and comprises two different vowels and three same consonants. I am so strong that I can spoil your entire work.

Can you find out who am I?

Asked by Neha on 13 Dec 2024

The host of a game show, offers the guest a choice of three doors. Behind one is a expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

Asked by Neha on 06 Aug 2021


It was a dark stormy night and a couple were in a car driving madly to a city. The car broke down and the husband had to go get help from someone who spoke his language. He was afraid to leave his wife alone in the car so he locked the car before leaving. When he came back, the car was in the same state as he had left it but his wife was dead, there was blood on the floor and there was a stranger in the car. What happened?

Asked by Neha on 02 Aug 2024

Hot Articles

Amazing Facts

No Solution

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