On Feb 17, 2009, at 12:55 PM, Dave Dyer <dd...@real-me.net> 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.
Why would initial research require a full bot molded around the new static evaluator? It's far simpler to leave the necessary machinery in place and add in the new static evaluator. That may mean extra work such as running two evaluation methods and reusing a prior move orderer/generator, but who cares?
There's a lot of power in quick and dirty evaluations. If the changes for the new static evaluation reduces bot strength, it's time to go back to the drawing board. It's only once you create a strength improvement that the steps you mention really matter.
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
