25,161
edits
Changes
no edit summary
'''Null Move Reductions''',<br/>
not to confused with the widespread [[Null Move Pruning]], work similar to [[Rainer Feldmann|Feldmann's]] [[Fail-High Reductions]], but use a [[Null Move]] Search rather than static [[Evaluation|evaluation]] and reduces by a amount of '''four''' plies rather than one. [[Omid Eli David]] and [[Nathan S. Netanyahu]] introduced so called '''Extended Null-Move Reductions''' <ref>[[Eli David|Omid David]], [[Nathan S. Netanyahu]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_19 Extended Null-Move Reductions]''. [[CG 2008]], [http://www.oedavid.com/pubs/nmr.pdf pdf]</ref> with an adaptive [[Depth Reduction R|R]] based on [[Depth|depth]].
=How it works=
If a null move [[Fail-High|fail-high]] occurs - opposed to Null Move Pruning - the search is reduced by '''four''' plies, rather than pruned. Thus, '''Null Move Reductions''' are therefor less vulnerable to [[Zugzwang]] and might even applied in (late) endings.
* [[Null Move Pruning]]
* [[Quiescence Search#StandPat|Standing Pat]] in [[Quiescence Search]]
=Publications=
* [[Eli David|Omid David]], [[Nathan S. Netanyahu]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_19 Extended Null-Move Reductions]''. [[CG 2008]], [http://www.oedavid.com/pubs/nmr.pdf pdf]
=Forum Posts=
