i literally mean the algorithm that would have nothing to say about any of those stones. (i.e. wouldn't declare any element of any of them to be in either of the two states that i had described).
s. ----- Original Message ---- From: "[EMAIL PROTECTED]" <[EMAIL PROTECTED]> To: computer-go@computer-go.org Sent: Wednesday, November 7, 2007 3:26:29 PM Subject: Re: [computer-go] use for Monte Carlo on 19X19? steve uurtamo said: > i wonder what is known about the set of unconditionally > dead and unconditionally living groups. there must be > something like a small and extremely fast mechanism for > this. what is everyone using? i mean a mechanism that > is independent of any fancy data structure that you would > have incrementally been maintaining. > > the idea is: identify at least one stone from every unconditionally > living and every unconditionally dead group on the board, and > report them as dead or alive. Well... suppose you have a chain that might connect to the dead group on the left, making a larger group that lives... or might also connect to the dead group on the right, making a different larger group that lives? But not both. Forrest Curo ----------------------------------------- This email was sent using AIS WebMail. http://www.americanis.net/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/ __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
