On Wed, Feb 14, 2007 at 10:57:38PM +0100, ?ukasz Lew wrote:
> Basically I wanted to implement a board in a hope that more people get
> attracted to Computer Go. But now this is more or less accomplished.
> So I decided to implement some kind of set canonical algorithms.
> But only those most common
On 2/14/07, Jason House <[EMAIL PROTECTED]> wrote:
?ukasz Lew wrote:
> Generally http://en.wikipedia.org/wiki/Disjoint-set_data_structure
> In my program it's a tree for each group of stones. In the root is
> number of pseudoliberties.
> Joining is cheap and checking group membership is cheap.
>
?ukasz Lew wrote:
Generally http://en.wikipedia.org/wiki/Disjoint-set_data_structure
In my program it's a tree for each group of stones. In the root is
number of pseudoliberties.
Joining is cheap and checking group membership is cheap.
Look at chain_t class. in board.cpp
Best,
?ukasz Lew
I ha
Hi Erik
So please tell us, if the topic is really that 'big', how many bits
does your hash-strengthening procedure safe, compared to the average
uniform random key generator with some basic checking?
1. As I told, I compute 64 bit hashes for the whole board, but since
the lowest 32 bits are s
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
> > Subject: Re: [computer-go] Zobrist hashing with easy transformation
> > comparison
> >
> >> did you read Anti Huima's pap
-- Forwarded message --
From: Nic Schraudolph <[EMAIL PROTECTED]>
Date: Feb 14, 2007 2:18 AM
Subject: Fwd: [computer-go] Zobrist hashing with easy transformation comparison
To: Erik van der Werf <[EMAIL PROTECTED]>
Hi Erik,
could you please forward the following to the computer g
