John, Jack and Jill are in a desert. John doesn't like Jill and hence decides to murder him. He poisons the water supply of Jill. Since it is a desert area, Jill must drink or he will die of thirst.
Jack does not know of the actions of John and also decides to murder Jill. To succeed in his ill motives, he removes the water supply of Jill so he dies of thirst.
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?
As shown in the image, the nine Dogs are square fenced. By constructing just two square fences can you make sure that two Dogs cannot meet each other without crossing the fence?
