I am aware such a decoupled program might not exist, but I don't see why one can't be created. When you say the "move generator has to be very disciplined" what do you mean? Do you mean that the evaluator might be used during move ordering somehow and that generating the nodes to expand is tightly coupled with the static evaluator? - George
On Tue, Feb 17, 2009 at 12:55 PM, Dave Dyer <[email protected]> wrote: > > While your goal is laudable, I'm afraid there is no such thing > as a "simple" tree search with a plug-in evaluator for Go. The > problem is that the move generator has to be very disciplined, > and the evaluator typically requires elaborate and expensive to > maintain data structures. It all tends to be very convoluted and > full of feedback loops, in addition to the actual alpha-beta which > is trivial by comparison. > > If you look at GnuGo or some other available program, I'm pretty sure > you'll find a line of code where "the evaluator" is called, and you could > replace it, but you'll find it's connected to a pile of spaghetti. > > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ > _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
