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

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

Asked by Neha on 18 Apr 2024


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?

Asked by Neha on 16 Apr 2022

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?

Asked by Neha on 23 Jun 2025


What goes up but never comes down?

Asked by Neha on 26 Oct 2021

There are two candles. Both will only burn exactly for an hour. How will you use these two candles to measure forty-five minutes?

Asked by Neha on 07 May 2024

On a bright sunny day, two fathers took their son fishing in the lake. Each man and son were able to catch one fish. When they returned to their camp, there were only three fishes in the basket. What happened?

PS: None of the fish were eaten, lost, or thrown back.

Asked by Neha on 05 Mar 2023


Find the next number in the sequence

5 12 24 36 ?

Asked by Neha on 08 Jul 2023

Why did Navjot Singh Sidhu put the new January calendar in the freezer

Asked by Neha on 01 Dec 2024

How can you throw a ball as hard as you can and have it come back to you even if it doesn't hit anything there is nothing attached to it and no one else catches or throws it.

Asked by Neha on 06 Nov 2025


It walks on 4 when its young, walks on 2 when it's older, and walks on 3 when its very old?

Asked by Neha on 17 Jul 2021

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