Computer Chess Club Archives


Search

Terms

Messages

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

Author: Uri Blass

Date: 05:30:51 05/04/02

Go up one level in this thread


On May 03, 2002 at 22:47:23, Michael Williams wrote:

>On May 03, 2002 at 22:33:35, Michael Williams wrote:
>
>>The first diagram shown in the previous post also had a large positive (1.63)
>>score.
>>
>>The second diagram shows 3x2=6 instances where a three-time repetition occurs.
>>
>>Conclusion:
>>
>>It looks like Fritz6 and Fritz7 also deal with the problem by "ignoring it."
>
>Or do they?
>
>Actually, this is why I hesitated to post in this thread--it's related to the
>problem somehow--why are such 3-time repetition lines displayed in their
>entirety with high scores?

A program should never evaluate a line with 3 times repetition as positive.
The only possible reason for it can be some bug.

The problem that was mentioned was different

The problem that was mentioned was about cases when the line is too short
because of hash tables and does not include repetition.

The problem is not evaluating repetitions as not 0.00 but cutting the tree based
on a score that is not 0.00 when it prevents the program to see the 0.00
that it could see by search.

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 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.

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.