Traveling Salesman Problem (GA) on Ancient Brain

The Traveling Salesman Problem makes a good demo for GA.

Click to run World: GA (TSP) at Ancient Brain.

• Reload for a new random Traveling Salesman Problem.
• Shows that for large problems, "Routes looked at as fraction of possible routes" is tiny, yet route looks pretty good pretty fast.

• Credits:
  • This is a port of "CC_035.4_TSP_GA" from The Coding Train.
  • Original version is online at P5 editor.
  • See videos parts one and two.
  • See other links in code.