This project uses a technique called simulated annealing to find a good (if not optimal) solution to the traveling salesperson problem. The problem is to find the shortest possible route which visits each city (point) and returns to the first city. Press “Generate” to generate random points or “Place” to place your own. You can maximize the path length instead by toggling the switch. If you watch the path changing, you will notice how at first it seems to find random combinations, but then narrows down the path and makes progressively smaller tweaks. Similar project: https://www.fourmilab.ch/documents/travelling/anneal/ Same project at much faster speed: https://turbowarp.org/472033734/fullscreen?turbo&fps=60&hqpen
