Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Quiescent search question to programmers

Author: Russell Reagan

Date: 13:36:01 03/09/03

Go up one level in this thread


On March 09, 2003 at 16:03:45, Uri Blass wrote:

>If I have perfect quiescent search that give me exact evaluation of every
>position(win,draw or loss) then even paying 10 plies may do you unbeatable.

When I say "perfect", I don't mean that you will get an exact score (win, loss,
or draw). I mean that you will always evaluate "quiet" positions, and you won't
miss any forcing lines.

>I do not know what you mean by perfect qsearch.

What I mean by "perfect qsearch" is that you will evaluate quiet positions where
there doesn't exist anything "violent", so the position's evaluation is unlikely
to change significantly. If your qsearch does "captures only", you could be
missing complete branches of forcing moves that start with checks, or other
forcing moves, and you might stop your qsearch too early in a position where
there are checks, or mate threats, or forks, pins, etc., but no captures. The
"perfect" qsearch would handle these things.



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.