Computer Chess Club Archives




Subject: Re: Finding mate in the quiesce search

Author: Álvaro Begué

Date: 08:52:21 08/24/04

Go up one level in this thread

On August 24, 2004 at 11:32:36, Anthony Cozzie wrote:

>On August 24, 2004 at 11:29:42, Álvaro Begué wrote:
>>>>If I evaluate a position using the quiescence search and that returns "mate in
>>>>5", how can I be sure that it's really a mate in 5 if the quiescence search
>>>>hasn't explored all the possible moves?
>>You are right: it is possible that there is a faster mate.
>>>Q-search will never return mate in 5.
>>Why not? If you include checks and check evasion, it can return mate in 5 with
>>no problem.
>Most people don't do infinite depth of q-checks.  I tried once and got a
>selective depth of 61 on a 2 ply search, and then it crashed on the 3 ply search
>;)  You would not believe the stupid lines it was looking at . . .

Yes, I have tried that type of thing myself. You can allow unlimited q-checks as
long as you only consider checks with a single response.

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.