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

[Rafael Caetano dos Santos <rcaetano@xxxxxxxxxxxxxxxx>]

Sai To Wang writes:
> > Go is *not* NP, Go is PSPACE-complete, and PSPACE > NP.
> 
> As far as I know, GO si PSPACE-complete without Ko and 
> is EXPTIME with Ko.

What does it mean "Go without ko"?
As I understand, if the ko rule is simply discarded, the game tree of
course grows.

bye 
    Rafael Caetano <rcaetano@xxxxxxxxxxxxxxxxx>