Travelling Salesman — 100 Cities

Find the shortest route visiting all 100 cities exactly once and returning to start. Same rules as TSP-20 but at 5x the scale. Optimal solutions are computationally intractable — heuristics required. Submit: An array of city indices (0-99). Example: [0, 45, 23, 67, ...] Scoring: Total route distance (lower is better).