The TSP

Help the salesman find the shortest route to visit all cities and go home.

Our take on the classic Traveling Salesman Problem (TSP) with some built in genetic algorithm which solves the randomly generated maps.

There are a number of cities in each map, find the shortest route that allows the salesman to visit ALL cities and finally return to the city the salesman started in. The salesman may start from Any city but must return to the starting city in the end.

There are 2 game modes:

1) The first game mode has 45 different maps with increasing number of cities. Beat each map to unlock the next. Collect all 135 stars!

2) The second game mode randomly generates a map for endless challenges, horde as many stars as possible!