Difference between revisions of "Quiescent Node"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 1: | Line 1: | ||
'''[[Main Page|Home]] * [[Search]] * [[Node]] * Quiescent Node''' | '''[[Main Page|Home]] * [[Search]] * [[Node]] * Quiescent Node''' | ||
| − | '''Quiescent Nodes''' are [[Node|nodes]] at [[Depth|depth]] zero or below, where a [[Quiescence Search]] is performed <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/926eaf0869b6f176# quiescent vs non-quiescent node counting] by [[Robert Hyatt]] from [[Computer Chess Forums|rec.games.chess.computer]], July 01, 1996</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=387518 Re: simple node definitions question] by [[Robert Hyatt]], [[CCC]], September 13, 2004</ref>. The most top subset of quiescent nodes at depth zero are also called [[Horizon Node|horizon nodes]]. If the quiescent node is an expected [[Node Types#CUT|Cut-Node]], that is the evaluated [[Quiescence Search#StandPat|standing pat]] score is already greater or equal than [[Beta|beta]], the quiescent node becomes a [[Leaf Node|leaf]] with the [[Lower Bound|lower bound]] score of beta ([[Fail-Hard|fail-hard]]) or the stand pat score ([[Fail-Soft|fail-soft]]). Otherwise, winning captures (or checks) may either cause a [[Beta-Cutoff|beta-cutoff]] or raise [[Alpha|alpha]] with an [[Exact Score|exact score]] at [[Node Types#PV|PV-Nodes]]. At expected [[Node Types#ALL|All-Nodes]] with evaluated score (far) below alpha, if no [[Tactical | + | '''Quiescent Nodes''' are [[Node|nodes]] at [[Depth|depth]] zero or below, where a [[Quiescence Search]] is performed <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/926eaf0869b6f176# quiescent vs non-quiescent node counting] by [[Robert Hyatt]] from [[Computer Chess Forums|rec.games.chess.computer]], July 01, 1996</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=387518 Re: simple node definitions question] by [[Robert Hyatt]], [[CCC]], September 13, 2004</ref>. The most top subset of quiescent nodes at depth zero are also called [[Horizon Node|horizon nodes]]. If the quiescent node is an expected [[Node Types#CUT|Cut-Node]], that is the evaluated [[Quiescence Search#StandPat|standing pat]] score is already greater or equal than [[Beta|beta]], the quiescent node becomes a [[Leaf Node|leaf]] with the [[Lower Bound|lower bound]] score of beta ([[Fail-Hard|fail-hard]]) or the stand pat score ([[Fail-Soft|fail-soft]]). Otherwise, winning captures (or checks) may either cause a [[Beta-Cutoff|beta-cutoff]] or raise [[Alpha|alpha]] with an [[Exact Score|exact score]] at [[Node Types#PV|PV-Nodes]]. At expected [[Node Types#ALL|All-Nodes]] with evaluated score (far) below alpha, if no [[Tactical Moves|tactical move]] is available, or due to [[Delta Pruning]] good enough to raise alpha, those [[Leaf Node|leaves]] return alpha ([[Fail-Hard|fail-hard]]) as an [[Upper Bound|upper bound]]. This may also appear, if this quiescent node was not a leaf, since some captures were not pruned, but tried without raising alpha. |
=See also= | =See also= | ||
Latest revision as of 15:25, 9 April 2020
Home * Search * Node * Quiescent Node
Quiescent Nodes are nodes at depth zero or below, where a Quiescence Search is performed [1] [2]. The most top subset of quiescent nodes at depth zero are also called horizon nodes. If the quiescent node is an expected Cut-Node, that is the evaluated standing pat score is already greater or equal than beta, the quiescent node becomes a leaf with the lower bound score of beta (fail-hard) or the stand pat score (fail-soft). Otherwise, winning captures (or checks) may either cause a beta-cutoff or raise alpha with an exact score at PV-Nodes. At expected All-Nodes with evaluated score (far) below alpha, if no tactical move is available, or due to Delta Pruning good enough to raise alpha, those leaves return alpha (fail-hard) as an upper bound. This may also appear, if this quiescent node was not a leaf, since some captures were not pruned, but tried without raising alpha.
See also
Forum Posts
- quiescent nodes, and history heuristic... by Joel Veness, CCC, January 30, 2003 » History Heuristic
- Quiescence node explosion by sandermvdb, OpenChess Forum, June 01, 2016
External Links
- Flora Purim - Once I Ran Away, YouTube Video
References
- ↑ quiescent vs non-quiescent node counting by Robert Hyatt from rec.games.chess.computer, July 01, 1996
- ↑ Re: simple node definitions question by Robert Hyatt, CCC, September 13, 2004
