While I can't talk specifically about UCT, I believe that transposition tables are one of the easiest and most profound speed ups you can do for a program. The answer really depends on the depth you're searching.
At two moves ahead, all results are unique. At 4 moves ahead, it's a 75% savings. At 6, the savings is over 99%. I was thinking recently about the "sum your children's move count" thing recently and realized that with transposition tables, that's really the only way to implement UCT. On 5/11/07, Chris Fant <[EMAIL PROTECTED]> wrote:
How much improvement should one see in a UCT program after adding a transposition table?
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
