[Computer-go] Combinatorics of Go

[Olivier Teytaud]

> When searching for start-of-the-art of Computer Go for my thesis, I
> discovered a very interesting paper "Combinatorics of Go" by John Tromp and
> Gunnar Farneback. I wonder if it is the same John Tromp that played with
> Many Faces. If I understand correctly, they computed the State-space
> complexity of 19x19 Go to be 2.08168199382· 10^170, which is really a big
> number.
>
>
As far as I see, when using the superko rule, the state (for including all
information for deciding if a move is legal) should include some information
on the history - so the state space complexity should be higher (and by very
far) than the number of legal positions on the board.

In japanese rules, there's only the ko to be kept in the state space.

For atari-go = ponnuki-go, nothing like that...

But there are probably in this mailing list some people more aware of this
than me.

Olivier
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://computer-go.org/pipermail/computer-go/attachments/20110102/f344c826/attachment.html>