|
BGonline.org Forums
The next major revolution in backgammon bots
Posted By: Jason Lee In Response To: The next major revolution in backgammon bots (Timothy Chow)
Date: Friday, 11 May 2012, at 1:29 a.m.
TSP is NP-complete. However, just because a problem is NP-complete doesn't mean that brute force is the only way we know how to solve it exactly.
Also, any discussion of the complexity class of a problem is really only saying something about the asymptotic running time. Perhaps for small instances of an NP-complete problem, it's easy to solve. I'm not saying that for TSP, though.
JLee
|
BGonline.org Forums is maintained by Stick with WebBBS 5.12.