On Thu, Sep 9, 2010 at 9:33 AM, <[email protected]> wrote: > When it plays a random move many moves are pruned and a new random > move is generated until an acceptable move is found.
Funny, that is roughly the strategy I used 3 years ago in the first version of Steenvreter (which then won the Olympiad). At some point I made it more like the Mogo playouts, because that was faster and at the time seemed to perform a bit better. Nevertheless, Steenvreter's current performance is still quite similar on the low end (also breaking even with gnugo on 9x9 at about 100 playouts), though I think I get most of that from good priors in the tree. Maybe I should dust off my old policy some time... Erik _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
