## 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

# A man travels between five cities

Best Answer bonanova, 11 May 2013 - 06:18 AM

The old traveling salesman problem.

Tractable for five cities, but unimaginably complex with just a few more cities.

Spoiler for shortest path

Spoiler for longest path

Go to the full post

Senior Member

• Members
• 1702 posts
• Gender:Female

Posted 11 May 2013 - 01:13 AM

A traveler wants to tour five cities in one day: Anamoose, Brindle, Catfish, Danville, & Easton; located at (1,0), (2,3), (-2,4), (5,-1), and (-3,-2), respectively. He wants to see all cities (the order doesn't matter) and travels from town to town in straight lines.

What is the shortest total distance possible?

Where should he start?

What is the sequence of cities he visits?

• 0

### #2 bonanova

bonanova

bonanova

• Moderator
• 5918 posts
• Gender:Male
• Location:New York

Posted 11 May 2013 - 06:18 AM   Best Answer

The old traveling salesman problem.

Tractable for five cities, but unimaginably complex with just a few more cities.

Spoiler for shortest path

Spoiler for longest path

• 0
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