Author: Stanislav Goldovski
Date: 05:48:03 04/04/98
Dear CCC-members, I have a few questions concerning programming transposition tables. Any help is highly appreciated! 1. What possibilities are there to increase the efficiency of hash tables for a given size? For example, I read that one shouldn't let horizon positions overwrite the more important positions near the root. Is that correct? If yes, how is that implemented? 2. What app. speed increase should I expect in the middlegame, due to the better move ordering from the hash table? 3. I heard that hash tables are more effective at higher depths. In other words, they will bring more with higher time controls. Is it so, and if yes - why? Thanks a lot in advance for your help, Stan
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.