Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: PV during quiescence search?

Author: Vincent Diepeveen

Date: 09:18:29 03/23/99

Go up one level in this thread


On March 22, 1999 at 07:57:06, Robert Hyatt wrote:

>On March 21, 1999 at 20:05:08, Charles L. Williams wrote:
>
>>Is it advantageous to keep updating the PV after entering the quiescence search,
>>or should this search be kept very simple?  I'm getting ready to add one,
>>captures only.  Thanks in advance.
>>
>>Chuck
>
>
>If you don't you won't see the end of the PV when you display it at the root,
>and this can make testing/debugging difficult, since you won't have any idea
>what the complete path looks like from the root to the position where you did
>an Evaluate() and then accepted that score.  In fact, your entire PV will have
>problems if you don't 'latch it' at the precise instant the score is 'ok'.

Sure. an easy solution is there however: if you get your PV from the
hashtable and if you are using several probes at the hashtable,
then you can get the PV out of the hashtable and this includes then the
q-search too.

Quick and easy!

Greetings,
Vincent



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.