I'm talking about a transposition table storing win/played values (MC interested values.).
If this ratio becomes tooo low (ex, win ratio below 1% with 100000 games confidence), you can be sure you can delete all the game tree after this move. All the transposition tables following this move. I will look in detail your links later in my home. Manu thanks, Eduardo --- A van Kessel <[EMAIL PROTECTED]> escribió: > > UCT could help to tiddy up the transposition table > > Erik van der Werf's thesis was mainly about > transposition table replacement algorihtms, IIRC. > > My personal summary: it is very hard to be more > clever > (at replacement) than "always replace when hitting > an occupied slot". > (this is very similar to beating a > LRU-replacement-sheme for disk-blocks; > but totally different ;-) > > > after a degree of confidence is gained. This could > I think, this is exactly what the transposition > table's purpose is: > Avoid doing the same computations over and over. > If you avoid them by some other means, the > hash-nodes will be > replaced anyway, eventually. No sweat. > > HTH, > AvK > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ > __________________________________________________ Preguntá. Respondé. Descubrí. Todo lo que querías saber, y lo que ni imaginabas, está en Yahoo! Respuestas (Beta). ¡Probalo ya! http://www.yahoo.com.ar/respuestas _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
