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. But both sides need not play into this to build a proof tree. By the way, an alpha/beta search IS IN FACT a proof, but it has to be constructed properly. > > > 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. Of course it depends on the board size. I think 5x5 can be properly "cracked" open in the near future. I think the proof tree for both sides can avoid those nearly infinite loops. I do agree that there are some practical difficulties to doing this and being able to claim it's a proof. - Don > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ >
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
