There are four main towns in Lateralia. We will call them A, B, C and D. They lie at the corners of a ten-mile square. In order to improve communications between the towns, the Lateralian Department of Transport decided to build a new road linking all four towns together. Because they had very little money, it was decided that the new road system should be as short as possible and still allow access from any one town to any other. The engineers came up with three designs shown below.
Number one uses 40 miles of road, number two uses 30 miles of road, and number three uses 28.3 miles of road. The designers naturally recommend plan number three because it employed the smallest road area and, therefore, cost the least. However, when they submitted their plan to the Minister of Finance, he accused them of extravagance and quickly pointed out a better design that required even less total road surface. What was his superior solution?
Because you are Anonymous we can't see your images (I recommend that you register). However, I think the minimum road length configuration will probably look something like the following:
Thanks, but I can't really take credit for it - it's a well-known optimisation problem, I've come across various versions of it dozens of times before.
I've never seen it before...but...it looks like a good "tavern bet" problem....!!!!!
Ah, Melody.....I think you're making a mountain out of a molehill....LOL!!!
I don't know civonamzuk - I expect you are joining in the fun like everyone else :)
They stick to the wet posts and the wet glass (and themselves) via surface tension.