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

A man in a car saw a Golden Door, Silver Door and a Bronze Door. What door did he open first?

Asked by Neha on 14 May 2021


What kind of band never plays music?

Asked by Neha on 09 Jul 2023

Jigsaw captured 100 people and make them stand in a circle and all these people are labelled as Person1, Person2, Person3... Person100. He made them play a crazy game in which Person 1 shot Person 2 and pass the gun to the next person and so on until one stands alive.

Which person will survive in the end?

Asked by Neha on 23 Sep 2025


I go up and I go down.
I go up towards the beautiful sky and down toward the green ground.
I am present tense.
I am past tense too
Children love me.

Who Am I?

Asked by Neha on 16 Jan 2025

There is so small cabin inside a deep forest.
All the forest burned out to worst possible but the inside of the cabin is still the same.
However all the person inside the cabin die.

How come ?

Asked by Neha on 15 Sep 2024

Who are the happiest people in IPL match?

Asked by Neha on 24 Jan 2025


You need to pick one entry from pot A and one from pot B to have a perfect match. Can you do it?

Football World Cup 2014

Asked by Neha on 22 Aug 2021

It can't be seen, can't be felt, can't be heard, and can't be smelt.
It lies behind stars and under hills, And empty holes it fills.
It comes first and follows after, Ends life, and kills laughter.
What is it?

Asked by Neha on 17 May 2021

How can one talk without saying a single word?

Asked by Neha on 25 Nov 2023


Can you find out the number of the parking space in which the car is parked?

Parking Space Riddle

Asked by Neha on 07 May 2026

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