Press space for a new set of points. Press g to run the genetic algorithm again. Press p to pause and unpause the algorithm. Given an arbitrary set of points, the Traveling Salesman Problem asks for the shortest path that passes through all points, in straight lines. Points are sometimes also called cities. Here, a genetic algorithm finds a better and better path through all points.
Inspired by the Traveling Salesman and genetic algorithms.