|
BGonline.org Forums
The next major revolution in backgammon bots
Posted By: Timothy Chow In Response To: The next major revolution in backgammon bots (Frank Berger)
Date: Thursday, 10 May 2012, at 11:33 p.m.
It's really solved.
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. People have developed lots of tricks for reducing the search space. If you set your mind to it, you can probably devise a pathological instance that defeats all the tricks, but the tricks are often very effective on problems that actually arise in the real world (and that haven't been specially designed to defeat the algorithm).
The TSP happens to be one of the NP-complete problems for which a ton of highly effective tricks have been developed.
|
BGonline.org Forums is maintained by Stick with WebBBS 5.12.