Re: computer-go: NP-complete problems solved?

["Patrick G. Bridges" <bridges@xxxxxxxxxxxxxx>]

Apparently, the same person had previously claimed to have 
solved the same problem, but was incorrect, and this is the
second try. The debates about the claims that I've seen
are on the theory-edge mailing list, at 
http://www.egroups.com/group/theory-edge

And just for reference, isn't Go P-space complete, not just
NP-hard? (For reference, we *can* prove that PSPACE >> P, 
and P ?= NP)