Travelling salesman variation in python

[Josiah Carlson]

> I would appreciate some comments on this :)

Look at current TSP algorithms, and exchange their minimization rutines 
for a maximization rutine.  TSP is an NP-hard problem, which means that 
there is no currently known algorithm for solving it in polynomial time. 
  You can approximate it or do a search on the solution space, but 
solving it requires searching basically all of the solution space.

  - Josiah