Author: Russell Reagan
Date: 16:38:32 08/19/03
Go up one level in this thread
On August 19, 2003 at 19:07:06, Charles Roberson wrote: > > I have been experimenting with various types of moves in qsearch. Obvious >moves to consider are captures, promotions, checks and check evasions. I have >tried qsearch with and without check evasion and it seems a waste to try them. >Captures and promotions are necessary. However, checks are unclear. > > Rudolf Huber told me that most commercial programs consider checking moves in >the qsearch. Does it really make a difference? > > As stated earlier today, qsearch is an accuracy vs speed tradeoff. Does >considering the effect of checking moves make up for the lost speed? The thoroughness of your qsearch will depend on each individual engine. Qsearch should fit into the "grand scheme" of your engine. The engine is only as strong as its weakest link. Remember that the purpose of qsearch is to find quiet positions to evaluate. For instance, if your evaluation function doesn't evaluate quiet positions accurately, then what is the point in trying to make qsearch as accurate as possible? Basically if both the qsearch AND evaluation aren't very reliable, then just do both "quick and dirty" and rely on your full-width search to cover up the errors.
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.