Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Returning PV from hash table

Author: Robert Hyatt

Date: 07:30:08 01/17/03

Go up one level in this thread


On January 17, 2003 at 09:08:01, Daniel Clausen wrote:

>On January 17, 2003 at 00:55:45, Robert Hyatt wrote:
>
>[snip]
>
>>>What are the problems with the basic triangular pv array?
>>
>>
>>None.  That is what I use.  Some have trouble understanding it at first
>>and some want something that they think is more efficient.  Either can work
>>but the array approach (to me) is the simplest, easiest to understand, and
>>provides the most reliable PV.
>
>For me, by far the most intuitive way is to have a local array, but it's
>basically the same.
>
>Btw: Did you ever measure how often it happens that the PV is already
>overwritten in the hashtable? If this happens often enough, it's probably worth
>it, to 'copy' the PV back in the hashtable after a search.
>
>Sargon


That is why I have always restored the PV moves to the hash table at the end of
each
search iteration.  It happens enough to be worthwhile, since the cost of
stuffing the
PV back in is essentially zero.



This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.