Author: Robert Hyatt
Date: 06:17:53 10/26/98
Go up one level in this thread
On October 26, 1998 at 02:10:37, vincent dichiacchio wrote: >my question is how programs deal with the possibility of a great non capture >move in the middle of a series of captures in a quiescence search. if the >quiescence score ignores that non capture, the score is faulty at best. >vince the q-search is *filled* with errors. We depend on the normal search to help avoid such problems, and when we don't, we just hope the fatal flaw (exposed in the q-search) isn't forced... but there's not a lot of time to add stuff to the q-search, otherwise you lose even more in the normal search in terms of depth...
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.