The Traveling Salesman

The algorithm to determine the shortest path between a set of points is a famous computer science problem, notoriously difficult, and known as the “Traveling Salesman Problem”.

This piece is another entry in my study journal of algorithmic emergent systems, and is based on this famous problem.

This time, I used the following description:
– Place N points randomly on the canvas, and assign a random direction to each point.
– At each step, draw the shortest line that connects all the points, and move each point along its defined direction

As usual, each step is typically drawn with very low opacity, and is repeated hundreds of thousands of times. Eventually, the interaction between overlapping lines creates unexpected patterns and textures.

The recent introduction of the new fxparams system was a great opportunity to expose the inner workings of the algorithm and let collectors actively contribute to the final outputs. In my previous long form projects, parameters ranges were carefully limited to make sure all outputs were consistent. Here, exploration of extreme ranges is voluntarily left open, allowing collectors to come up with their own variations.

With this system, the collector becomes a critical part of the art creation process.

The project was released as an open edition on fxhash. 574 editions were minted.

View the full collection (574 editions) on FxHash…