On Fri, May 22, 2009 at 5:47 PM, Dave Dyer <dd...@real-me.net> wrote: > > Some lines of play involving large captures will effectively never > terminate, even with superko rules in effect. > > I doubt it is possible to eliminate all these non-terminating > lines of play in any way that is provably correct. > > .. So while claims of solution by exhaustive search might be very > convincing, I doubt they can ever be proved.
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. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
