Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A test position for chess programs(importance of tablebases)

Author: Paul

Date: 11:24:26 01/19/01

Go up one level in this thread


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.

Thanks for the quick response! I also tried first checking hash & storing
the etb result in hash, but somehow that was quite tricky to get right
for me, I didn't succeed last week. I had a conflict with hash reuse
between searches & storing/reusing the PV in/from hash, but I'll try
again later, now I know that that's the way to go ...

Thanks again,
Paul



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.