4 ms·
I'm impressed they found a dataset this hard, but not much harder. It's a delicate balance between beating the last Traveling Salesman hiscore (Netherlands), an
by OsrsNeedsf2P 2y ago
I'm impressed they found a dataset this hard, but not much harder. It's a delicate balance between beating the last Traveling Salesman hiscore (Netherlands), and never finishing your compute
- bjornsing 2y agoDo we know they didn’t just prune problematic bars from the dataset until they found a one with a solution?
- dumbfounder 2y agoYou and I don’t know. But this is hacker news so there is probably somebody here keeping them honest.
- omoikane 2y agoIn the "computations" page[1], the table lists the Netherlands computation as costing 97 CPU years with 6 months of elapsed time, while the Korean bars costs 44 years of CPU time and 3 months of elapsed time. I can't tell if the two problems were solved using the same hardware. [1] https://www.math.uwaterloo.ca/tsp/korea/computation.html https://www.math.uwaterloo.ca/tsp/korea/computation.html
- BrtByte 2y agoGotta respect the planning that went into choosing a problem that's both absurd and actually solvable