Keyboard: type a town’s number to select it (for towns 10–13, type both digits), Backspace undoes, Enter departs.
The classic travelling salesman problem asks for the shortest journey that visits each city once and returns to the start. This game uses an open-path version: the start is fixed, but you may finish anywhere.
Each town is a point. The distance between two towns is the straight-line distance:
Add the distances of all the segments to get your route length. The goal is to choose the order that makes that sum as small as possible.
With 10 towns and the starting town fixed, there are 9! = 362,880 possible visit orders. Here, 9! means 9 × 8 × … × 1. With 14 towns, that grows to 13! = 6,227,020,800.
100% means you found a shortest route. Choosing the nearest town at each step can help, but does not always produce the best overall journey.
Explore the travelling salesman problem on Wikipedia ↗