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

Irene killed hundreds of people mercilessly and yet the police were not able to put her behind the bars. Why?

Asked by Neha on 05 Feb 2024


While handling a project, the landscaper is asked by the owner of the mansion that he wants four trees in front of his mansion that are exactly equidistant from each other.

How will he do it?

Asked by Neha on 20 Nov 2023

John can place six large boxes or nine small boxes into a carton.

Can you find out in how many cartons can he place sixty-six boxes in total?

Asked by Neha on 10 Jul 2023


Check out the number list below and find what number comes next in the sequence.

111 , 113 , 117 , 119 , 123 , 137 , ?

Asked by Neha on 30 Mar 2026

You need to move three matchsticks to form three squares. Can you do it?

MatchSticks Squares Riddle

Asked by Neha on 17 Jun 2023

What building has the most stories?

Asked by Neha on 21 Feb 2022


John and Jacob are twin brothers. One of them is a liar whereas the other one is a truth-teller.

I called their home number and one of them picked up.
I asked. 'Does John lie?' The person replied with a yes.

Whom did I talk with, John or Jacob?

Asked by Neha on 23 Nov 2024

What does Alexander the Great and Winnie the Pooh have in common?

Asked by Neha on 17 Jul 2025

what's the probability of getting a king or a queen from a pack of 52 cards?

Asked by Neha on 27 Sep 2024


You can find some missing letters in the picture. By placing two particular letters in the spaces, you can form a nine lettered word beginning from one of the corners and going clockwise direction to the middle. Can you find out the letters and the word?

Make the Word

Asked by Neha on 06 Oct 2023

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