On Tue, 2007-04-10 at 00:06 +0200, alain Baeckeroot wrote: > Le lundi 9 avril 2007 14:06, Don Dailey a écrit : > > But the point is that > > as long as you can provide time and memory you will get improvement > > until perfect play is reached. > Is there any proof that heavy player converge toward the same solution as > the pure random playout ?
I don't really know, but I suspect it converges as long as you score correctly at the end of the game. If you don't score correctly, then I suppose anything can happen. - Don > With infinite resource, i agree that random playout will find the best move. > But it seems that nothing is guaranted for heavy playout. > > Alain _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
