If you have four towns forming a square, what is the minimum amount of roads needed to connect all four towns? Can you figure out this cool math problem? See how nature does it in a second!
We need to find the best possible pattern of lines to determine the minimum amount of “roads” needed. There are many possible combinations, like joining all the points with diagonals, or connecting all four points with a big circle, square, U-shape, etc. The best way is actually found by watching what nature does. If you dip a prop with the four points into a soapy liquid, the connecting soap film tends to minimize the surface area, thereby leading to the least length. The “roads” intersect at 120 degree angles. If the prop has three points, the points will again be connected by roads at 120 degree angles.