Author: Russell Reagan
Date: 12:57:55 07/17/02
Go up one level in this thread
Granted that I've never attempted an opening book, but it seems like using a hashing technique might be a little much. I think there is an acceptable method that would work without hashing, and it shouldn't take tons of time. Maybe have an offset into the file where moves at ply 1 start, where moves at ply 2 start, and so on, then sort those sections according to the source square, then by the destination square. Or something similar. This seems like it would be simpler, less buggy, and you'd never have to worry about a hash collision resulting in an inferior move. The goal of the opening book is to avoid playing those moves that are ever so slightly inferior. Against most human opponents chess engines play the opening better than their human opponent (usually), but there is only a small difference in the quality of opening moves when you play a commercial engine or a GM, so I think you shouldn't run the risk of a hash collision in this case. In addition to that, it seems like it would be more work to use a hashing scheme for your opening book. What do you think? Russell
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.