Author: Dann Corbit
Date: 11:45:25 01/19/01
Go up one level in this thread
On January 19, 2001 at 14:43:05, Paul wrote: >On January 19, 2001 at 14:30:57, Dann Corbit wrote: > >>On January 19, 2001 at 14:13:24, Dieter Buerssner wrote: >> >>>I do store EGTB scores in the hash tables. They are specially flagged >>>and stored as exact scores. I first probe the hash table, and then EGTBs. >>>This will avoid many disk accesses. Also, I ignore the depth stored >>>in the hash, for EGTB positions, because the information will be valid >>>for any depth. >>> >>>Nevertheless, sometimes I only get about 20% of the normal speed, when >>>very many TB accesses are done. >> >>Give the tablebase files 100 megs of hash and you will see the performance go >>back up. > >Hi Dann, > >do you mean 100MB of etb cache, or add 100MB to the regular hash table? >Or both ;) EGTB Cache. If you already have a big hash table for the program (64 megs or better) then a larger one will only add a little bit of performance. But if you have a pile of EGTB's to romp through, a big cache for those will help a lot.
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.