Author: Landon Rabern
Date: 12:54:06 06/12/01
I am going to rewrite my opening book code. Right now it has all positions stored in a file and then when the program is run, it loads them all up and puts them into a hashtable that uses chaining to resolve collisions. I am not satisfied with this because it eats a lot of memory for large books. I would appreciate it if others would tell me what they do. I think it would be better to just leave the whole thing on disk and read from it when necessary. I guess I could just write the hashtable to disk and still use chaining, but that seems overly nasty, open addressing might work better. Thoughts? Regards, Landon W. Rabern
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.