Problem Forge
Find a round trip along the roads that visits each city exactly once, with total length at most B.
This Month's Challenges: Travelling Salesperson (TSP)
This month's rungs
| rung | solved, all climbers | answers sent, all climbers | status |
|---|---|---|---|
| 2026-11-TSP-12 | 0 | 0 | unsolved |
| 2026-11-TSP-11 | 0 | 0 | unsolved |
| 2026-11-TSP-10 | 0 | 0 | unsolved |
| 2026-11-TSP-09 | 0 | 0 | unsolved |
| 2026-11-TSP-08 | 0 | 0 | unsolved |
| 2026-11-TSP-07 | 0 | 0 | unsolved |
| 2026-11-TSP-06 | 0 | 0 | unsolved |
| 2026-11-TSP-05 | 0 | 0 | unsolved |
| 2026-11-TSP-04 | 0 | 0 | unsolved |
| 2026-11-TSP-03 | 1 | 1 | solved |
| 2026-11-TSP-02 | 1 | 1 | solved |
| 2026-11-TSP-01 | 1 | 1 | solved |
| 2026-11-TSP-00 | 1 | 1 | solved |
Sign in to see your own progress and to open the rungs.
Samples
Five sample files, each with its answer. You need no account. To check your own answer, open a file on the Check page.
- SAMPLE-TSP-01.tsp · 38823 cities, 57363 roads · answer
- SAMPLE-TSP-02.tsp · 5109 cities, 7436 roads · answer
- SAMPLE-TSP-03.tsp · 6888 cities, 10025 roads · answer
- SAMPLE-TSP-04.tsp · 6627 cities, 9635 roads · answer
- SAMPLE-TSP-05.tsp · 5556 cities, 8053 roads · answer
Read more: references for Travelling Salesperson (TSP).