John and Jill are madly in love with each other. To remind Jill of his pure love, John wants to send her a ring by post but in their country where burglary is quite prominent, any package that is not locked comes under the risk of being stolen for the contents.
John and Jill possess many padlocks but neither one of them has the other key.
Can you find a way John can send the ring to Jill safely?
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?