Computer Chess Club Archives




Subject: Re: Returning PV from hash table

Author: David Rasmussen

Date: 15:50:29 01/15/03

Go up one level in this thread

On January 15, 2003 at 18:38:38, Nathan Thom wrote:

>I just realised that my program LittleThought (in progress, hoping noone has yet
>used this name?) only stores the best move in the hash table, so when a hash hit
>occurs it cannot display the entire PV for that depth like everyone else's seems
>Do you all store the entire PV in the hash entry? or some other trick im

No one stores the pv, it takes to much space.

In general, you can't always get the entire PV if you use hashing, and you do if
you want a serious program.

First of all, you can try to probe the hashtable for the position resulting from
the best move at ply 0 (the root) then if you get a best move for this resulting
position, this will be the next move of the pv and so forth. So you can probe
the hashtable to get the whole pv. It's a little more complicated than this in
practice, but you get the idea.

Secondly, it helps to store the pv in the hashtable after each iteration.

There are other tricks to try, too.


This page took 0.02 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.