Author: Antonio Dieguez
Date: 04:03:22 12/17/05
Go up one level in this thread
On December 17, 2005 at 02:38:29, Vasily Serbock wrote: >I have heard that there is a paper call "Generalized Null >Move Quiescence Search" by Beal in 1990 on vol 43 of >Artifical Intelligence. Since I do not have a copy >of the paper, would you please someone explain to me >what that is and effectiveness of that algorithm in >the chess programs? Is it used in Crafty? >I'm a new student to chess programming. you could do null-move in the quiescence search and put your initial score at that value instead of the evaluation. Then you don't standpat only if the eval is too good in the case you are losing pieces (in the case of a capture quiescence search). It consumes a big big lot of nodes though if it is used just like this. I would prefer just a static function to see a threat, or the capture generation function for the oponnent. If it is used by programs (sometimes it looks as they do because some deep combinations they can see) I wonder how. There are at least one thread about this somewhere , surely more. happy life.
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.