The ‘Shortest Road Track’ Problem!

The dots below represent 4 cities at the corners of a square. The task is to connect these cities to each other by road.

You may to do it as you wish. The aim is to connect these using minimum overall road length. It doesn’t matter what the distances are between any 2 towns. The only condition is that it should be possible to reach from one town to another. The total length of the road should be kept minimum.

  • You can use straight lines or curved lines.
  • You may add more junctions in between.

You can add your thoughts in the comments, or submit your complete ideas using the form below. You can even upload images and videos. The best ideas will be featured in our upcoming weekly newsletter. By best, we mean the following:

  • New and original ways of thinking and approaching the problem
  • It’s not just about the correct answer
  • Even partial ideas and thoughts are great (and most welcome)

To upload any files (images, video) to support your idea, use this link.

Here are some of the ideas received and the discussion so far!

guest
86 Comments
Inline Feedbacks
View all comments

[…] See the Problem here. […]

[…] See the Problem here. […]