Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Returning PV from hash table

Author: Omid David Tabibi

Date: 16:48:23 01/16/03

Go up one level in this thread


On January 15, 2003 at 23:40:00, Robert Hyatt wrote:

>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
>>to.
>>
>>Do you all store the entire PV in the hash entry? or some other trick im
>>missing?
>
>
>walk the hash table.  IE play the best move, then make it on the board, and
>do a hash probe.  If you get a hit, see if you have a best move.  If so, that
>is the second move, display it and make it.  Probe again.
>
>The flaw is that every probe might not get a "hit" because that entry was
>overwritten by something else, and the PV will end prematurely...

What are the problems with the basic triangular pv array?



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.