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

What number comes next in the series?

5 15 5 18 5 24 14 20 _

Asked by Neha on 15 Jun 2023


Can you find a five letter word that is left with only two letters if one is removed?

Asked by Neha on 20 Jul 2021

You want to boil a two-minute egg. If you only have a three-minute timer (hourglass), a four-minute timer and a five-minute timer, how can you boil the egg for only two minutes?

Asked by Neha on 17 May 2021


As you can see that fifteen matches have been used to form an arrangement. What you have to do is remove any six of them to make them ten.

Make the Word TEN

Asked by Neha on 14 May 2021

A man always keeps a spare tyre in his car. To make full use of all the five tyres, he changes the tyres in a manner that for a distance of 1, 00,000 km, each of them runs the same distance.

Can you calculate the distance travelled by each tyre on that journey?

Asked by Neha on 14 Sep 2023

In a jungle where there are no street lights or any other artificial source of lights, I notice a black snake crossing the road.
How did I get sight of the snake?

Asked by Neha on 15 Oct 2023


There is a box full of marbles,
all but two are blue,
all but two are green,
and all but two are red.

How many marbles are in the box?

Asked by Neha on 01 Jan 2024

If,

A + B = C
D - C = A
E - B = C

Based on the above equations, find out the answer for:

D + F = ?

Asked by Neha on 01 Jan 2026

How is the moon similar to a dollar?

Asked by Neha on 26 Sep 2023


Jenifer is learning to drive her car. She went down a one way lane and in the wrong direction. But she do not break any law.

How come ?

Asked by Neha on 30 Jun 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