Computer Chess Club Archives

Search

Messages

Subject: Re: PV update after retrieval from hash table

Author: José Carlos

Date: 10:56:57 11/30/00

Go up one level in this thread

On November 30, 2000 at 12:09:02, Leen Ammeraal wrote:

>I use a trangular array pv[i][j] to
>keep track of the principle variation,
>as usual. Each row has length pv_length[i].
>However, it is not clear
>to me what to do with this array
>when I retrieve a move from my hash table.
>Can anyone give me a hint, please?
>Leen Ammeraal

  I use a simpler approach in Averno. My PV length is always the nominal depth
(so it is always equal or shorter than the real PV counting extensions). When I
get an exact hash move, I insert a special code (0) in the PV, so when I print
the PV, when I find a 0, I add 'HT' and stop printing.

  Hope this helps,

  José C.

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.