There are three boxes on a table. One of the box contains Gold and the other two are empty. A printed message contains in each box. One of the message is true and the other two are lies.
The first box says "The Gold is not here".
The Second box says "The Gold is not here".
The Third box says "The Gold is in the Second box".
In a town, there are over 100 flats.
Flat-1 is named first flat.
Flat-2 is named second flat.
Flat-3 is named third flat.
A visitors 'Victor' decides to walk through all the flats, he finds all the flats except flat-62.
Victor later founds that the local of the town have given it another name.
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?