Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question for Chess Programmers

Author: James Robertson

Date: 19:07:43 12/21/98

Go up one level in this thread


On December 21, 1998 at 21:25:29, Peter McKenzie wrote:

>On December 21, 1998 at 20:18:07, Roberto Waldteufel wrote:
>
>>
>>On December 21, 1998 at 20:09:34, James T. Walker wrote:
>>
>>>Hello,
>>>I have noticed on most all programs that when the program finds a "Mate in 12"
>>>it shows up in the score and the program makes it's move.  The question is:  Why
>>>can't you save the PV and if the opponent makes the next move in the PV then why
>>>can't you continue with the PV without doing another search.  Then continue on
>>>until the opponent is either mated or breaks the original PV.  It seems to me if
>>>you were in time trouble you might lose on time by searching when the moves to
>
>Computers practically never lose on time unless it is an insanely fast bullet
>type time control.
>
>>>mate are already known.  I guess since none of the programs I know of do this,
>>>there must be a reason for it.  Can someone enlighten me?
>>>Jim Walker
>>
>>I can think of no reason at all. My program Rabbit does exactly as you describe
>>above and plays the closing moves instantly when a mate is discovered, and
>>always has done this from its earliest days. I can't imagine why other programs
>>would not do this as well.
>
>My program LambChop doesn't do anything special when there is a forced mate - it
>just thinks for its alloted time.  I've thought of changing it to play forced
>mates instantly, but by thinking for longer it might find a faster mate.  Its a
>matter of taste I guess.
>
>cheers,
>Peter

I agree; there are usually a lot of forced mates in a given position, and the
first one found is usually NOT the fastest.

James



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.