On 5/11/07, Chris Fant <[EMAIL PROTECTED]> wrote:
How much improvement should one see in a UCT program after adding a transposition table?
Hard to say in general because this depends on how deep the tree goes, the allocated search time, etc. For shallow trees I suspect that you might even play worse because the amount of transpositions is low and the UCT move selection becomes more costly. It would be interesting to hear some experiences from someone who's tested this in a state-of-the-art UCT program. Erik _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
