[Computer-go] Combinatorics of Go

[Aja]

It is really an interesting paper. I will try to understand its proof or 
write a program to verify it.

Aja

----- Original Message ----- 
From: ""Ingo Althöfer"" <3-Hirn-Verlag at gmx.de>
To: <computer-go at dvandva.org>
Sent: Saturday, January 01, 2011 6:23 PM
Subject: Re: [Computer-go] Combinatorics of Go


> And to add one more point:
> He is also the same person that participated
> in the design of the Tromp-Taylor rule set.
>
> So, John is sort of an all-purpose man.
>
> Ingo.
>
>
> -------- Original-Nachricht --------
>> Datum: Sat, 1 Jan 2011 01:40:20 -0800
>> Von: Robert Solovay <solovay at gmail.com>
>> An: Aja <ajahuang at gmail.com>, computer-go at dvandva.org
>> Betreff: Re: [Computer-go] Combinatorics of Go
>
>> Definitely the same John Tromp.
>>
>> --Bob Solovay
>>
>> On Sat, Jan 1, 2011 at 1:09 AM, Aja <ajahuang at gmail.com> wrote:
>> > Dear all,
>> >
>> > 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.
>> >
>> > Aja
>> >
>> >
>> > _______________________________________________
>> > Computer-go mailing list
>> > Computer-go at dvandva.org
>> > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
>> >
>> _______________________________________________
>> Computer-go mailing list
>> Computer-go at dvandva.org
>> http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
>
> -- 
> NEU: FreePhone - kostenlos mobil telefonieren und surfen!
> Jetzt informieren: http://www.gmx.net/de/go/freephone
> _______________________________________________
> Computer-go mailing list
> Computer-go at dvandva.org
> http://dvandva.org/cgi-bin/mailman/listinfo/computer-go