Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hash table & draw detection--added info

Author: Uri Blass

Date: 16:25:59 05/04/02

Go up one level in this thread


On May 04, 2002 at 19:08:30, Dieter Buerssner wrote:

>On May 04, 2002 at 08:30:51, Uri Blass wrote:
>
>>Maybe the problemin Fritz is because of trying to construct the pv out of hash
>>tables(I have no idea how programs do it) but I think that in this case it is
>>better not to print the pv at least in cases that it includes repetition.
>
>I think, this is very likely. And the reasons, how this can happen, can be seen
>in this thread.
>
>>I know that fritz7 can display stupid pv's because of trying to construct the pv
>>out of hash tables and I think that it is better at least to check if the pv
>>makes sense before printing it.
>
>Well - in the case of repetition in the PV and score != draw_score it may be
>easy to detect. But this will only be a small fraction of the cases, where wrong
>PVs can come out of the HTs

It is possible to calculate the evaluation of the positions in the last pv moves
and not printing the last pv moves if the evaluation is not similiar to the
evaluation that the program gives to the root move.

Repetition when the evaluation is 0.00 is only one private case of these cases.
You may need to do some search for the positions that are 1 or 2 plies before
the end of the pv but the time that you need for searching depth 1 or depth 2 is
only a small fraction of the time that the program searches.


Uri



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.