Re: [gnugo-devel] Improvement of the hash table in GNU go

[bump]

> What I propose is a very simple but powerful change: We introduce a
> new table of random number for each reading function that we want to
> cache the result of.  Then we use these tables to create a unique hash
> value for a combination of position and read function on a certain
> target.  That way we get a single type of entries and can get rid of a
> lot of the current complications.

I can see the advantage of this.

> I haven't implemented this yet, but I told it to Dan, and he suggested
> that I write a description here and start a discussion.

Apart from the technical aspects of this, I would think that a
major change in the caching should be post 3.4 unless it it is
implemented as an experimental option.

Dan