> >You can just prove that you can make a large-enough chain that is >unconditionally alive. I believe that's what Erik did. In practice, >you cannot do an exhaustive search using superko rules because then >hash table scores cannot be used.
I don't think you can always do that. For example, if white is capturing a chain of size 30, how can you prove that black can never profit by continuing inside that 30 space void. In fact, in many cases you can demonstrate that he should. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
