Author: Horace Ho
Date: 22:39:16 01/13/99
Questions again, thanks for your time :-)
1. How big a hash table is meaningful? What's the
typical ratio between:
a) average total numbers of node my program can
search each turn, and
b) the total number of hash records?
2. What are stored in each hash record?
- id
- score
- ... and?
3. What's the typical size of each hash record?
4. What to do if 1a) is bigger than 1b)?
- throw away some records? or... ?
Is it already meaningless to have a hash table
if 1a) > 1b) ?
5. I keep hearing Zorbrist. Could someone put me to
the algorithm (or better a c implementation)?
Thanks again
horace
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.