## Welcome to BrainDen.com - Brain Teasers Forum

Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-) |

Guest Message by DevFuse

# connecting cities

Started by BMAD, Sep 23 2013 01:11 PM

1 reply to this topic

### #1

Posted 23 September 2013 - 01:11 PM

There are four cities located on the vertices of a square. Your task is to design a network of roads such that (1) every city is connected with every other city, and (2) the total length of the roads is minimized. The roads can intersect each other.

### #2

Posted 23 September 2013 - 08:38 PM Best Answer

Spoiler for Nice problem

*The greatest challenge to any thinker is stating the problem in a way that will allow a solution.*

- Bertrand Russell

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users