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?
The Puzzle: Here is a famous prize problem that Sam Loyd issued in 1882, offering $1000 as a prize for the best answer showing how to arrange the seven figures and the eight 'dots' .4.5.6.7.8.9.0. which would add up to 82
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