Traveling Salesman is one of the classic NP-Hard problems: finding the optimal solution can take a long time. It is easy to see the solution for a small number of cities: you just look at all the possible