question about quiescient search and static eval

Discussion of chess software programming and technical issues.

Moderators: hgm, Rebel, chrisw

jaespo
Posts: 7
Joined: Sun Oct 12, 2014 11:58 pm
Location: Omaha Ne

question about quiescient search and static eval

Post by jaespo »

If a search algorithm uses quiescent search, won't all of the leaf nodes have much of the pressure in the position relieved?

(Definition: pressure in this context means threat to capture)

Wouldn't that make the static evaluation function inaccurate, because the amount pressure in the position should be a part of the evaluation?
xmas79
Posts: 286
Joined: Mon Jun 03, 2013 7:05 pm
Location: Italy

Re: question about quiescient search and static eval

Post by xmas79 »

The amount of pressure is indeed included in the evaluation. King safety and threatened pieces are two examples of evaluating the pressure.
User avatar
hgm
Posts: 27807
Joined: Fri Mar 10, 2006 10:06 am
Location: Amsterdam
Full name: H G Muller

Re: question about quiescient search and static eval

Post by hgm »

The point is that if a threat to capture is worth more than actually performing the capture (because it will turn out to be a trade, and leave a position without threats), the side to move will prefer to stand pat (harvesting the threat-to-capture bonus in the current position) rather than trade.
jaespo
Posts: 7
Joined: Sun Oct 12, 2014 11:58 pm
Location: Omaha Ne

Re: question about quiescient search and static eval

Post by jaespo »

Ah, I knew I was missing something!

I just took another look at the code in https://chessprogramming.wikispaces.com ... nce+Search and I see now that it calls Evaluate at start of each qsearch node and uses that as a stand-pat cutoff.