Salesman Algorithm (random) 2

(remixed from Salesman Algorithm (random), by sayochi) by jaykapo
See Code Download Embed
restart the project after changing the total_points veriable

- this project finds the shortest past between given amount of points.

if N = point amount
N! = different possible ways

5 points = 120 different ways
10 points = 3,628,800 different ways

this project completely depends on random switching. so there might be a lot of previously calculated routes.

Created April 17, 2023

Last updated April 17, 2023

Shared April 17, 2023