TSP Art (disegnare usando il Traveling Salesman Problem, roba da nerd)
The traveling salesman problem (TSP) is an old and well-studied problem in computer science. Given a collection of cities on a map, a salesman must make a tour of the cities, visiting each once, and returning to the city from which he started.
