Question 665825
City A (0, 0), City B (450, 300), City C (-810, 760), City D (-810, 0) 

first find the distance between cities

City A (0, 0), City B (450, 300)

*[invoke hummingbird_distance_2D 0, 0, 450, 300]


City B (450, 300), City C (-810, 760)


*[invoke hummingbird_distance_2D 450, 300, -810, 760]


City C (-810, 760), City D (-810, 0)

*[invoke hummingbird_distance_2D -810, 760,-810, 0]


City D (-810, 0),City A (0, 0)

*[invoke hummingbird_distance_2D -810, 760,0, 0]

 the total distance covered on the tour will be equal to sum all distances above:

{{{AB+BC+CD+DA=540.83+1341.34+760+1110=3752.17miles}}}