[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Bug-gnubg] Idea for encoding 2-sided database
From: |
Jim Segrave |
Subject: |
Re: [Bug-gnubg] Idea for encoding 2-sided database |
Date: |
Mon, 28 Mar 2005 20:04:32 +0200 |
User-agent: |
Mutt/1.4.2.1i |
On Mon 28 Mar 2005 (16:47 +0100), Ian Shaw wrote:
> Could we reduce the size of the two-sided database by omitting gin
> positions?
>
> Gnubg could assume that if the position was inside the database space
> but the result was not stored, then the position is gin. A simple 0-ply
> evaluation could be used to verify who has won, and as a sanity check.
>
> I don't know how much effect this would have, but it would have greater
> benefits for the larger databases because more positions would be gin.
I've not looked at the code, but I think it calculates where to look
as a fixed function of the current position. If that's the case, then
you need different indexing of the database, which might not be a gain.
--
Jim Segrave address@hidden