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.

Posted

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