Please excuse me if this question has been answered before, my brief
look through the archives I have did not find it. How does one
compute unconditional life and death? Ideally, in an efficient
manner. In other words, I want to know, for each group of stones on
the board that share a common fate, if they are alive with certainty
or if there fate is unknown. I only want to find results that would
be totally obvious to a very weak human player and provably correct.
What algorithms are used?
- George
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
