The Bored Traveling Salesman solutions
The Bored Traveling Salesman was solved using Pascal by 4 contestants. Solution sizes: average 3010 bytes (shortest: 1964; longest: 4806).
40. ![]() 133. ![]() 209. ![]() 731. ![]() |
The Bored Traveling Salesman was solved using Pascal by 4 contestants. Solution sizes: average 3010 bytes (shortest: 1964; longest: 4806).
40. ![]() 133. ![]() 209. ![]() 731. ![]() |