The traveling salesman problem asks for the shortest route by which a salesman can visit a set of locations and return home. A choice of heuristics to attempt to solve this problem is provided by Mathematica. Drag the points to change the locations the salesman visits to see how the route changes. Change the method to see which finds the best route for the choice of points. Alt+Click to add additional points to be toured.