Author: Robert Hyatt
Date: 07:29:33 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 You can't stop in the middle. You either choose to keep going until you finish the move at the root you are searching, or else you throw what you have done in the toilet and use the previous result you did complete.
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.