Jump to content
BrainDen.com - Brain Teasers
  • 0

A man travels between five cities


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?

Share this post

Link to post
Share on other sites

1 answer to this question

  • 0

The old traveling salesman problem.

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

D A B C E [or reverse] is 17.49

B E D C A [or reverse] is 28.74

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

  • Recently Browsing   0 members

    No registered users viewing this page.