Author: Rafael Andrist
Date: 06:00:16 11/21/00
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
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.