Author: Stanislav Goldovski
Date: 04:53:52 04/07/98
Go up one level in this thread
On April 04, 1998 at 16:12:21, Robert Hyatt wrote: >On April 04, 1998 at 08:48:03, Stanislav Goldovski wrote: > >>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? > >when you store a position in the table, store the depth *below* that >position as well, commonly called the "draft". then when you do a >store into the table, you compare the depth remaining at this position >in the search to the draft for the entry in the table you are wanting to >replace, and keep the one with the largest value.. > Thanks a lot for your reply. Just one thing I didn't understand, sorry: How do I calculate the 'draft'? Isn't the 'depth below' just MAXDEPTH-depth_above? (Currently, I store the depth of the position in the tree to make sure that I may skip the search when I encounter the same position later, provided the stored depth is higher.) TIA, 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.