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 ?
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 computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
