Author: Tim Foden
Date: 09:54:59 08/13/00
Go up one level in this thread
On August 13, 2000 at 12:14:40, Larry Griffiths wrote: >Now Im curious what a Qsearch is. Is that like each time you call alpha-beta? > >Larry. Nope. If you imagine your normal alpha-beta minimax search. At the leaves of the tree, you call your static evaluation function. However, what if there is a hanging piece? The Qsearch, or quiescence search, is a search for a "quiet" position... one in which all "relevent" captures (i.e. winning ones. This implies quite a lot of forward pruning) have been made, so it should be OK to call the static evaluation function now. So a normal search has tends to have 3 layers: 1) Root node search, 2) Normal search, 3) Quiescence search. Most of the time the number of Qnodes searched in my app. is about 4 times the number of normal nodes.
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.