Re: Paper “Complexity of Go” b y Robson
John Tromp <[email protected]> Mon, 18 Jun 2018 23:35:02 +0200
| Newsgroups | gmane.games.devel.go |
|---|---|
| Message-ID | <CAOU__fydyV4CTzfXjaak24TfPsaW3aJQZpqcwYAA9WmbWeYsJQ@mail.gmail.com> |
On Mon, Jun 18, 2018 at 10:24 PM, Álvaro Begué <[email protected]> wrote: > I don't think ko fights have anything to do with this. John Tromp told > me that ladders are PSPACE complete: https://tromp.github.io/lad.ps Ko fights are needed to take Go problems beyond PSPACE. For Japanese rules they suffice to go beyond (assuming EXPTIME != PSPACE), but for Chinese rules it's an open problem. regards, -John _______________________________________________ Computer-go mailing list [email protected] http://computer-go.org/mailman/listinfo/computer-go