shortest path through 4 vertices of a square (Chile 1993 P1)
Source:
May 27, 2019
geometrysquarepathdistance
Problem Statement
There are four houses, located on the vertices of a square. You want to draw a road network, so that you can go from any house to any other. Prove that the network formed by the diagonals is not the shortest. Find a shorter network.