Puzzle
Four cities are located at the four corners of a square. The distance between adjacent cities is 100 miles. Your task is to come up with a highway system that connects all cities to each other with minimal cost. The cost for building a highway is $100K per mile, so you really want to figure out the minimal total length for the highway. Note that you are not required to have the shortest path between any two cities, and the order in which the cities get connected via the highway system is entirely up to you, just so long as you achieve a minimum total cost. All you need to make sure is that you can get from any city to any other using the highway system. Is there anything peculiar about the solution you find? 1
