Enough with traveling salesman who hate long road trips.
Mario Andretti has joined the team, and he loves to drive!
His route today comprises eight towns, placed at the corners of an octagon.
Here are their coordinates:
Edit: 7 and 8 are labeled incorrectly. They should be switched.
+---+-+-+
City x y
+---+-+-+
1 0 2
2 0 4
3 2 6
4 4 6
5 6 4
6 6 2
7 4 0
8 2 0
+---+-+-+
The inter-city distances, to save some calculations, are N-S and E-W distances of 6, along with four different diagonal distances of 2.828, 4.472, 5.657 and 6.083 6.325
If Mario begins driving at city 1 (coordinates 0 2) and drives until he has visited them all, how far will he be able to drive, and what city will he visit last?
If his objective is to return to his hotel in City 1 after visiting the other cities, how long of a trip could he accomplish?