Author: Brian Richardson
Date: 07:23:04 11/21/00
Go up one level in this thread
On November 21, 2000 at 09:00:16, Rafael Andrist wrote: >Normally, quiescence search is used at the end of a tree. It seems to me, that >it makes only sense to do qsearch after the last increment. But if there is a >time limit and after the last increment is no time to do a qsearch (or you must >stop in the middle of the search), the program can have a completly wrong >evaluation. How is this handled in chess programs? > >Rafael B. Andrist Most programs use iterative deepening, so the principal variation (and a best move so far) is always known from the prior (last) completed iteration. If the qsearch or the "full width" search does not complete before a time limit I think the results of that incomplete iteration are generally discarded. For example, the search (and qsearch of each leaf node) finishes for iteration at depth n. Depth n+1 does not finish. The best move from the depth n search is used.
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.