25,161
edits
Changes
Created page with "'''Home * Dictionary * Null Move Observation''' '''Null Move Observation''',<br/> the observation that for the side to move there is almost..."
'''[[Main Page|Home]] * [[Dictionary]] * Null Move Observation'''
'''Null Move Observation''',<br/>
the observation that for the [[Side to move|side to move]] there is almost always a better alternative ([[Moves|move]]) than doing [[Null Move|nothing]]. The Null Move Observation might be considered as [[Tempo|tempo bonus]] in [[Evaluation|evaluation]], but it fails in [[Zugzwang]] situations.
=Base=
The Null Move Observation is base of:
* [[Null Move Pruning]]
* [[Null Move Reductions]]
* [[Fail-High Reductions]]
* [[Razoring]]
* [[Reverse Futility Pruning]]
* [[Quiescence Search#StandPat|Standing Pat]] in [[Quiescence Search]] <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=443417&t=41942 Re: Without the null move observation] by [[Harm Geert Muller]], [[CCC]], January 11, 2012</ref>
=Publications=
* [[Gordon Goetsch]] , [[Murray Campbell]] ('''1988'''). ''Experimenting with the Null Move Heuristic in Chess''. AAAI Spring Symposium Proceedings, pp. 14-18.
* [[Don Beal]] ('''1989'''). ''Experiments with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, pp. 85-98. ISSN 0004-3702, edited version in ('''1999'''). ''The Nature of MINIMAX Search''. Ph.D. thesis, IKAT, ISBN 90-62-16-6348. Chapter 10, pp. 101-116
* [[Don Beal]] ('''1990'''). ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, pp. 85-98. ISSN 0004-3702
* [[Rainer Feldmann]] ('''1997'''). ''Fail-High Reductions.'' [[Advances in Computer Chess 8]], available as [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4399933A9FAE32A9C855DED714120C66?doi=10.1.1.51.4897&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4897 CiteSeerX]
* [[Don Beal]] ('''2006'''). ''[[File:alg1986review.txt|Review of a nullmove-quiescence search mechanism from 1986]]''. (Draft) <ref>courtesy of [[Don Beal]] and [[Carey Bloodworth]], [http://www.talkchess.com/forum/viewtopic.php?t=58603&start=13 Re: Antique chess programs] by [[Carey Bloodworth|Carey]], [[CCC]], December 16, 2015</ref>
=Forum Posts=
* [http://www.talkchess.com/forum/viewtopic.php?t=41942 Without the null move observation] by Diogo Barardo, [[CCC]], January 11, 2012
=References=
<references />
'''[[Dictionary|Up one Level]]'''
'''Null Move Observation''',<br/>
the observation that for the [[Side to move|side to move]] there is almost always a better alternative ([[Moves|move]]) than doing [[Null Move|nothing]]. The Null Move Observation might be considered as [[Tempo|tempo bonus]] in [[Evaluation|evaluation]], but it fails in [[Zugzwang]] situations.
=Base=
The Null Move Observation is base of:
* [[Null Move Pruning]]
* [[Null Move Reductions]]
* [[Fail-High Reductions]]
* [[Razoring]]
* [[Reverse Futility Pruning]]
* [[Quiescence Search#StandPat|Standing Pat]] in [[Quiescence Search]] <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=443417&t=41942 Re: Without the null move observation] by [[Harm Geert Muller]], [[CCC]], January 11, 2012</ref>
=Publications=
* [[Gordon Goetsch]] , [[Murray Campbell]] ('''1988'''). ''Experimenting with the Null Move Heuristic in Chess''. AAAI Spring Symposium Proceedings, pp. 14-18.
* [[Don Beal]] ('''1989'''). ''Experiments with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, pp. 85-98. ISSN 0004-3702, edited version in ('''1999'''). ''The Nature of MINIMAX Search''. Ph.D. thesis, IKAT, ISBN 90-62-16-6348. Chapter 10, pp. 101-116
* [[Don Beal]] ('''1990'''). ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1, pp. 85-98. ISSN 0004-3702
* [[Rainer Feldmann]] ('''1997'''). ''Fail-High Reductions.'' [[Advances in Computer Chess 8]], available as [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4399933A9FAE32A9C855DED714120C66?doi=10.1.1.51.4897&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4897 CiteSeerX]
* [[Don Beal]] ('''2006'''). ''[[File:alg1986review.txt|Review of a nullmove-quiescence search mechanism from 1986]]''. (Draft) <ref>courtesy of [[Don Beal]] and [[Carey Bloodworth]], [http://www.talkchess.com/forum/viewtopic.php?t=58603&start=13 Re: Antique chess programs] by [[Carey Bloodworth|Carey]], [[CCC]], December 16, 2015</ref>
=Forum Posts=
* [http://www.talkchess.com/forum/viewtopic.php?t=41942 Without the null move observation] by Diogo Barardo, [[CCC]], January 11, 2012
=References=
<references />
'''[[Dictionary|Up one Level]]'''
