Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: About qsearch...

Author: Sune Fischer

Date: 04:54:08 12/30/01

Go up one level in this thread


On December 30, 2001 at 04:46:01, Uri Blass wrote:

>>I'm not sure, I'm doing exactly what Bruce has explained here:
>>http://www.seanet.com/~brucemo/topics/quiescent.htm
>
>The algorithm as described there make unnecessary moves.
>
>I evaluate moves before I make them and the algorithm that is described does not
>do it.

How is that possible, don't you need the attack boards to do the eval?
Is it a very simple eval perhaps?

>For me makemove and generating all the attack tables cost time so I prefer to do
>it only after verifying that the capture is good enough.

Why not update the attack boards _before_ generating moves, then you have a fast
makemove that you can do at the leaf too. I have no choice but to do the move
before evaluation or else I would simply not evaluate the right position, you
too must be doing some sort of move I think.

>Guessing the evaluation of a capture without making it is easy(I can find easily
>exact score with a simple evaluation but even after I do my evaluation more
>comlicated I can get a good estimate for it based on material and use the
>estimate to avoid generating unnecessary captures).
>
>Uri



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.