You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**TheTick****Member**- Registered: 2012-12-03
- Posts: 27

There is a King who has just built four cities. This king is a very peculiar king as he built these four cities so that each individual city made up the corner of a perfect square. In addition all four cities are on perfectly level ground. Though there is a slight problem; the king forgot to build the roads. This king, in all of his peculiarity, decided he wanted all of his roads to be straight, and he wanted to be able to get from one city to any other city using these roads. How can you design the king's roads so that you use the least amount of road possible, while still meeting his criteria?

Spooooon!!!

Offline

**anonimnystefy****Real Member**- From: The Foundation
- Registered: 2011-05-23
- Posts: 15,507

This is a well known problem and is easily solved using soap bubbles. Interestingly enough, if you dip two frames connected by four pegs in a square position into soap watter, the soap film that forms around the pegs will try and minimize its surface so you'll get something that looks like this: >-<

This result can also be proved rigorously, but I thought it might be interesting to mention this.

Here lies the reader who will never open this book. He is forever dead.

Taking a new step, uttering a new word, is what people fear most. ― Fyodor Dostoyevsky, Crime and Punishment

Offline

**MathsIsFun****Administrator**- Registered: 2005-01-21
- Posts: 7,535

I love it when nature solves mathematical puzzles for us!

Now if we could just get soap bubbles to solve traveling salesman problems ... hang on, is this remotely possible? Maybe being only 3-dimensional is a limiting factor.

Offline

**anonimnystefy****Real Member**- From: The Foundation
- Registered: 2011-05-23
- Posts: 15,507

Hi MIF

Unfortunately, the soap will get you only a path which connects all the roads and that has minimal length and which probably doesn't go from any city to any other with a direct road, ie. the cities are not the only nodes int the "graph" formed by the soap film.

Here lies the reader who will never open this book. He is forever dead.

Taking a new step, uttering a new word, is what people fear most. ― Fyodor Dostoyevsky, Crime and Punishment

Offline

**pRo9aMeR****Member**- Registered: 2012-07-28
- Posts: 43

I think I'm oversimplifying it, but wouldn't a direct road to and from each city suffice? The roads would make the shape of a square with an "X" in the middle.

Offline

**bob bundy****Moderator**- Registered: 2010-06-20
- Posts: 6,335

hi pRo9aMeR

Close, but you can get shorter.

Oh yes, in case you have misunderstood: it is not required that every city is connected independently to each of the others. You jsut have to be able to get from one to another by road(s)

Bob

You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei

Offline

**anonimnystefy****Real Member**- From: The Foundation
- Registered: 2011-05-23
- Posts: 15,507

Hi pRo9aMeR

The solution looks something like in the picture below.

Here lies the reader who will never open this book. He is forever dead.

Offline

**pRo9aMeR****Member**- Registered: 2012-07-28
- Posts: 43

I did slightly misunderstand the question...But now I'm confused. Why wouldn't a simple "X" be shorther than the ">-<"? I 'looks' like it takes longer to travel that way...

Offline

**bob bundy****Moderator**- Registered: 2010-06-20
- Posts: 6,335

hi pRo9aMeR

You have to calculate the total distance along all the roads. With a simple x that should be easy enough with Pythag.

With the more complex Stefy-x it will help to know the angle between the lines is 120 degrees.

Bob

You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei

Offline

Pages: **1**