Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Forced moves

Author: Robert Hyatt

Date: 20:54:28 07/30/99

Go up one level in this thread


On July 30, 1999 at 10:10:48, Ed Schröder wrote:

>On July 30, 1999 at 08:58:40, Steve Maughan wrote:
>
>>On July 30, 1999 at 08:52:04, Robert Hyatt wrote:
>>
>>>On July 30, 1999 at 00:28:06, Ed Schröder wrote:
>>
>>>>Search the first iteration without alpha/beta.
>>>>
>>>>Ed Schroder
>>>>
>>>
>>>How does that help?  Peter said a move is forced if all other moves lead
>>>to mate.  Note to mate-in-one, but to mate-in-any.  1 ply search won't find
>>>this.
>>
>>Maybe Rebel has mate finding extensions in the quiescent search and is therefore
>>able to find some simple mates with only one ply search?
>
>You guessed right.
>
>Ed Schroder
>
>>Steve Maughan


This is easy to test.

My hypothesis:  simple search is not good enough to discover that all moves
but one lead to mate, in any positions except for those near the point where a
game is already over (one side is mating the other).

Ed's:  A simple search is good enough to discern forcing moves.

How about someone looking for positions where all moves but one lead to a
forced mate...  IE one move must _not_ get mated, while all the rest do.
Then we decide whether the short search of Rebel can see this or not.

Then we decide how often this kind of position occurs, and how often (when it
does) is a shallow search enough to recognize the forced nature.

I don't think (a) it will work very well; (b) that it is worth the effort to
search with alpha=-inf, beta=+inf for every root move; (c) that by the time
this might have a chance of identifying a forcing move, the game is already
over and saving time is pointless...

My opinion, of course...



This page took 0.02 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.