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 [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
