Perhaps 'implementation' is not the right word, but IIRC the fundamental
problem was that Antti Huima used a 4-segment scheme. With Zobrist hashing
(xor update) you need at least 8 segments (or 16 with colour symmetry).
Otherwise you get trivial collisions (where positions with only a small
number
At 07:07 AM 9/17/2019, Brian Sheppard via Computer-go wrote:
>I remember a scheme (from Dave Dyer, IIRC) that indexed positions based on the
>points on which the 20th, 40th, 60th,... moves were made. IIRC it was nearly a
>unique key for pro positions.
Correct, but it's only useful for game recog
At 07:07 AM 9/17/2019, Brian Sheppard via Computer-go wrote:
>I remember a scheme (from Dave Dyer, IIRC) that indexed positions based on the
>points on which the 20th, 40th, 60th,... moves were made. IIRC it was nearly a
>unique key for pro positions.
Correct, but it's only useful for game recog
Thanks for the input, so far.
Erik, is this the paper that you were referring to:
http://fragrieu.free.fr/zobrist.pdf "A Group-Theoretic Zobrist Hash
Function" Antti Huima.
If so, do you have any sources on what's wrong with it? You say that his
"implementation" was flawed -- does that mean that
https://www.real-me.net/ddyer/go/signature-spec.html
On Tue, Sep 17, 2019 at 4:16 PM Brian Sheppard via Computer-go <
computer-go@computer-go.org> wrote:
> I remember a scheme (from Dave Dyer, IIRC) that indexed positions based on
> the points on which the 20th, 40th, 60th,... moves were made. II
I remember a scheme (from Dave Dyer, IIRC) that indexed positions based on the
points on which the 20th, 40th, 60th,... moves were made. IIRC it was nearly a
unique key for pro positions.
Best,Brian
-Original Message-
From: Erik van der Werf
To: computer-go
Sent: Tue, Sep 17, 2019 5:5
Apparently it's not so easy to keep a mailing list running smoothly... For
now at least we can still see archives at:
https://www.mail-archive.com/computer-go@computer-go.org/
On Thu, Aug 29, 2019 at 4:14 PM Adrian Petrescu wrote:
> Indeed, I think a lot of aspects of the mailing list software
Hi Stephen,
I'm not aware of recent published work. There is an ancient document by
Antti Huima on hash schemes for easy symmetry detection/lookup.
Unfortunately his implementation was broken, but other schemes have been
proposed that solve the issue (I found one myself, but I think many others
fo
Dear Go programmers,
I'm interested in experimenting with some new ideas for indexing and
searching Goban positions and patterns and I want to stand on the shoulders
of giants. Which papers, articles, blog posts or open-source code should I
read to get concrete knowledge of the approaches used in
