2007/1/11, steve uurtamo <[EMAIL PROTECTED]>:
> Well then the time is now. Look at the Sylvain's post on the > scalability of Mogo. if the improvement continues to hold with more doublings, that's great.
I did not do further experiments as 35k simulations per move already takes 30s per move, so about 1h15min per game. As I never consider making less than 200 or 400 or even 800 games to have precise statistics, you can imagine the amount of computer time it asks. I have precise statistics only with 35k and 70k, and unprecises with 2 minutes per move. Yet, for scalability issues I could consider making much less games. If my lab's cluster becomes available again, I will certainly try and post the results. i am perhaps under the misguided opinion that there are all
kinds of structural reasons why the best 'scalable' programs can't arbitrarily be doubled (i.e. that memory and not time was a bottleneck).
You're right, memory is an issue. However, for the kgs slow tournament, I implemented (as many of the "UCT guys" did before :)) a "garbage collector" in the UCT tree. I simply remove the nodes with a little number of visits. This allow now MoGo to think as long as you want, never filling the memory. I did not do experiments to precisely know how much, with the same number of simulations, the playing level decreases by this garbage collection. I think it is negligeable, at least for thinking time of a few minutes. Sylvain
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
