On Dec 12, 2007 10:19 PM, David Fotland <[EMAIL PROTECTED]> wrote: > Many Faces' life and death search is best first and probability based, > but I don't use UCT to select moves. I select the move that has the highest > probability of changing the value of the root (from success to fail or vice > versa). I don't use MC to evaluate the endpoints. I look forward down one > line until the result is clear (alive or dead), but I follow the best move > from the move generator, not random moves. >
Out of curiosity, how does that compare to proof number? Proof number uses a heuristic like "for this outcome to occur, N child nodes must have outcome X". It picks the path with the smallest N.
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
