From: terry mcintyre <[EMAIL PROTECTED]>
For a large number of playouts, the estimated scores should converge as the
game progresses. This is particularly true if the random distributions strongly
favor moves where each opponent monotonically increases the score - keeping
one's groups alive, keeping the opponent dead, and growing areas wherever
possible. Of course there must be enough variability to permit sacrifice plays
and nakade placements; throwing a stone into a group will initially look like a
bad play, but if the placement succeeds, it is a very good play, the success of
which must be properly attributed to the
earlier placement - or even further back, to the surrounding and cutting and
eye-killing moves which ultimately led to the placement move.
--- expanding my own email:
Is it possible to cache the results of life-and-death analysis for use by
playouts, so that dead groups stay dead, live groups stay alive, areas
increase, and players tend to efficiently improve the status of their own
groups ( and demote the status of the opponents' ) wherever that is feasible?
____________________________________________________________________________________
Never miss a thing. Make Yahoo your home page.
http://www.yahoo.com/r/hs_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
