Using TSP art to make products
I'm a big fan of mathematically derived art. There's a famous mathematical problem called the "Traveling Salesperson Problem" (TSP). It goes like this, given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? So