The Bored Traveling Salesman solutions
The Bored Traveling Salesman was solved using OCaml by 2 contestants. Solution sizes: average 3656 bytes (shortest: 3391; longest: 4187).
The Bored Traveling Salesman was solved using OCaml by 2 contestants. Solution sizes: average 3656 bytes (shortest: 3391; longest: 4187).