On Thu, 2007-10-11 at 18:37 -0400, Chris Fant wrote:
Someone already did: Stone eater.
On 10/11/07, terry mcintyre [EMAIL PROTECTED] wrote:
Erik,
It would be great to see Steenvreter on the 9x9 cgos server. BTW, can you
translate Steenvreter for us English speakers? Thanks!
Eater
On Mon, 2007-07-09 at 12:46 -0400, Joshua Shriver wrote:
Ok found some KGS games, and they make a lot more sense. With the
specification I can see what all of the OT, AP, TM, FF, etc commads
are. However I don't understand the way it sets the location, so far
nothing I've seen describes it.
On Wed, 2007-04-04 at 15:25 +0200, Unknown wrote:
either, would have preferred periods or semicolons.)
Oops. I meant colons, of course.
AvK
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer
On Thu, 2007-02-22 at 17:50 +, Stuart A. Yeates wrote:
Does anyone know of a document outlining the IGS protocol?
There are a number of programs and servers which support the IGS
protocol, including the IGS server. I am trying write a tool to
interact with these servers and would prefer
On Wed, 2007-02-14 at 10:45 +0100, Erik van der Werf wrote:
From: Nic Schraudolph [EMAIL PROTECTED]
Date: 12 February 2007 10:45:50 GMT+11:00
To: computer-go computer-go@computer-go.org
Subject: Re: [computer-go] Zobrist hashing with easy transformation
comparison
did you read Anti
On Thu, 2007-02-08 at 15:55 -0500, Don Dailey wrote:
The children of one parent almost certainly will have different 64 bit
keys than the children of the other parent.
Not if the parents collide.
(apart from symmetry/canonical considerations):
if H(A)==H(B),
then after applying move 'm'
--
On Thu, 2007-02-08 at 15:58 -0800, steve uurtamo wrote:
tranforms as the cannonical key. In most cases 8 positions will
IIRC, choosing the smallest may cause some unwanted effects. Not sure...
It's not quite as good as using 64 bits free and clear because there is
compression
On Wed, 2007-02-07 at 16:28 -0500, Don Dailey wrote:
On Wed, 2007-02-07 at 16:17 -0500, Don Dailey wrote:
I have a hash funciton that creates a 64 bit cannonical hash of
the position. The same hash is produced after a rotation for
Most people do incremental hashing, which is cheaper even
On Fri, 2007-01-12 at 15:51 +, Mehdi Ahmadi wrote:
Hello thank in advance for any interests/ responses.
I'm unfortunately (or not) doing a dissertation as part of my final year
project (undergraduate) on the game of Go. The exact title is: Can the game
of go be solved? Analysis of
On Thu, 2006-11-30 at 14:44 -0800, David Doshay wrote:
This is not my experience at all.
SlugGo was first written by a graduate student with data structures
that made sense to them, but not to me. I rewrote it to use
completely different data structures but with exactly the same
10 matches
Mail list logo
