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

John was drowned by he was not wet. How?

Asked by Neha on 16 May 2025


Can you find a number that lies one third of the distance between 1/3 and 2/3?

Asked by Neha on 29 Dec 2020

What does below Rebus say?

XLR8

Asked by Neha on 10 May 2021


Can you decipher the two rows to find the hidden word?


Make the Word

Asked by Neha on 14 May 2021

I always drive my customer away.

Who am I?

Asked by Neha on 29 Oct 2024

When Jack was six years old he hammered a nail into his favourite tree to mark his height. Ten years later at age sixteen, Jack returned to see how much higher the nail was. If the tree grew by five centimetres each year, how much higher would the nail be?

Asked by Neha on 17 May 2021


What does below science rebus mean?

Ag Ag Ag
Ag SPOON Ag
Ag Ag Ag

Asked by Neha on 11 Oct 2023

A girl was sitting in her hotel room when she heard a knock on the door. She opened the door and found that a man was standing outside.
The man said, "Oh! I am really sorry, I thought this was my room."
He then walked through the corridor to the elevator. The girl did not know the man. She closed her door and called security asking them to apprehend the man.
What made her suspicious of that man? He might have been genuinely mistaken.

Asked by Neha on 28 Aug 2023

This puzzle is for Harry Potter fans. Do you know why Tom Riddle is called Lord Voldemort?

Asked by Neha on 11 Feb 2025


There is a number which when you multiply by 3 and subtract 2 from the result, then the resulting number is the reverse of the actual number.

What is the smallest number that stands true on the statement?

Asked by Neha on 20 Aug 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