Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Node count differences with Omids verification search

Author: Uri Blass

Date: 08:14:41 11/22/02

Go up one level in this thread


On November 22, 2002 at 11:03:01, Daniel Clausen wrote:

>On November 22, 2002 at 10:39:16, Uri Blass wrote:
>
>[snip]
>
>>I do not know what most do but I do not care after finding a mate to find the
>>shorter mate.
>
>Do you test that if you found a 'mate-in-N' in the previous move, that you now
>have found a 'mate in N-1'? Otherwise your engine might delay the mate until
>it's too late.
>
>Sargon

No I do not test it but I test during search if there is repetition or 50 move
rule.

I do not plan to use hash tables for pruning the tree in the case that alpha
tells me that there is a mate score so there should be no practical problem.

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.