In the Travelling Salesman Problem, n cities have (n-1)!/2 possible routes, and 20 cities produce approximately 6×10^16 combinations.