Find the best approximate solution you can to https://en.wikipedia.org/wiki/Travelling_salesman_problem The routes shown are initially completely random. Your code should replace the random solution with a better one. The final displayed distance is the total over 10 trials at different sizes. The individual data for each trial is also displayed. All routes are redrawn on completion. You're welcome to also display intermediate results as you calculate.
https://scratch.mit.edu/discuss/topic/226345/ Thanks to DadOfMrLog for the seeded PRNG that allows us to test all solutions against the same data. The judging will be done against a different seed from the one used here. See forum for extra info re runtime.
