If a Salesman has to travel to multiple cities, is there a method to always find the fastest route across the cities? The Travelling Salesman Problem is one of the most fascinating mathematical problems to conquer. This Project showcases my solution to the Problem where we can columns, from top to bottom, in rows, from left to right, and then sort the nodes from their coordinates. However, such simulations in scratch always require the most difficult math! It took a whole day to sort out the trigonometry! NOTE: The more cities you place, the less accurate the AI may become; it may "miss" faster routes. When many calculations are performed, many details will become less precise sadly. I am not aware of any way around this. CREDITS All coding was done by me
