Javascript is not enabled. This site can still works but it'll be more interactive when javascript is enabled.
loading...
Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
stevefan1999
11 hours ago
|
on: Fable 5 vs. GPT-5.6 Sol on an NP-Hard Problem: Does /goal help?
...is this not a Travelling Salesman Problem?
reply
hyperpape
11 hours ago
|
parent
Related, but not quite the same. The solution to this problem can have more than one loop, whereas TSP definitionally has only one. Not quite sure how that changes the difficulty or the tools that you’d use.
reply
loading story #48959642