The travelling salesman The goal is for the salesman to go through all of the cities and back to the start travelling the shortest distance possible Official studio: https://scratch.mit.edu/studios/5960247/ Just click the flag and watch Z and X to toggle variables I will share more attempts The salesman always travels to the closest checkpoint This was the first solution that came into my head so I decided to make a scratch project on it Obviously, it is not the solution I once changed the checkpoint limit to 10000 and sat watching it find it's way for about 8 minutes Comment if you do the same
