Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Using too-shallow mate scores from the hash table

Author: Robert Hyatt

Date: 19:50:47 07/06/98

Go up one level in this thread


On July 06, 1998 at 21:21:51, David Eppstein wrote:

>On July 06, 1998 at 20:40:01, Robert Hyatt wrote:
>>Not sure why it was removed, probably
>>at the request of someone that insisted on finding shorter mates.  Once a mate
>>score hits the hash table in CB or the other Store() code, that's it...
>
>Which is why I suggested the version at the start of this thread:
>treat mate scores as infinite depths when using them for a cutoff.
>But if the mate score is within the alpha,beta window, use the actual
>finite depth.

That causes the same problem... you fail high but can't resolve the
score because you find the mate bound, but can't search deeply enough
to find the mate score...

I'd do one or the other, but not a mixture.  I think that Bruce only
stores a >XXX for mates or mate bounds, but I have never had a bit of
trouble with storing actual mate scores, and haven't for many many
years.



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.