Computer Chess Club Archives


Search

Terms

Messages

Subject: hash collissions

Author: Vincent Diepeveen

Date: 09:03:33 03/09/00


hello, in previous posting i said something about my doubt
of the number of legal positions being a practical number.

I did a big 'collission detection test'.

DIEP checks hashtable everywhere, using 8 probes. That's a lot.
I created a second table which verified the position.

Note that diep stores positions with 64 bits in hashtable (i'm using
something like 20 bytes a position or so, incredible much but i store
evaluation in 21 bits or so too besides a 21 bits normal score).

And for cache lines it doesn't matter. 8 or 20 or 32 bytes. All the
same.

anyway. i didn't have a single collision when searchin openings position
with 1M entries for 500M nodes.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.