Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: My miscellany of minor chess programming problems ?

Author: rasjid chan

Date: 12:36:15 08/27/05

Go up one level in this thread


On August 27, 2005 at 10:09:21, Jon Dart wrote:

>> So this mean we don't need to keep pv[][] if we have hash tables (it is
>> like double accounting).
>
>I think this is false, given you have a finite size hash table and must
>eventually replace something. I have some experience: I used to retrieve pv from
>the hash table but now use a pv array and back up the scores.
>
>--Jon

They tell me so and I begin to doubt. Maybe as Dr Hyatt says, backup the pv.
It may be best to be simple as I don't yet know how hashing twists and turns
within.

Rasjid




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.