Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question about Qsearch

Author: Inmann Werner

Date: 09:58:10 03/24/99

Go up one level in this thread


On March 24, 1999 at 12:27:28, Andrew Dados wrote:

>
>On March 24, 1999 at 12:13:03, Bruce Moreland wrote:
>
>>
>>On March 24, 1999 at 09:30:19, Inmann Werner wrote:
>>
>>>Hello.
>>>
>>>My question sure is a little dumb, but anyway....
>>>
>>>When in Qsearch a check occurs, and the opponent can not come out of the check
>>>(cause he only tries capture moves!) a position is evaluated to be mate,
>>>although this is not right.
>>>I am worried about this, but looking at the play of my program, it seems to
>>>never occur.
>>>In normal search, when a check comes, I extend. I also extend on the way to the
>>>Qsearch. But if I am really in Qsearch I seem to ignore the problem.
>>>
>>>Is it a problem or am I seeing Ghosts?
>>>
>>>Werner
>>
>>In the classic Ken Thompson quiescent search, you call "search" from "quies" if
>>you are in check, so weird stuff like this is prevented.
>>
>>You have a bug.

Think alos so.

>>
>>The reason it is not making your program suck is that you can have a fairly
>>broken quiescent search and still play decent chess, and in fact breaking your
>>quiescent search a little might make it play better.
>
> If it plays better it's an 'improvement', not a 'bug' :))

That must be tested, and this I will do now!

>-Andrew-
>>
>>bruce



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.