Verified Null-Move Pruning
| dc.creator | David-Tabibi, Omid | |
| dc.creator | Netanyahu, Nathan S. | |
| dc.date | 2008-08-08 | |
| dc.date.accessioned | 2026-07-07T09:55:38Z | |
| dc.date.available | 2026-07-07T09:55:38Z | |
| dc.description | In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever the shallow null-move search indicates a fail-high, instead of cutting off the search from the current node, the search is continued with reduced depth. Our experiments with verified null-move pruning show that on average, it constructs a smaller search tree with greater tactical strength in comparison to standard null-move pruning. Moreover, unlike standard null-move pruning, which fails badly in zugzwang positions, verified null-move pruning manages to detect most zugzwangs and in such cases conducts a re-search to obtain the correct result. In addition, verified null-move pruning is very easy to implement, and any standard null-move pruning program can use verified null-move pruning by modifying only a few lines of code. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/0808.1125 | |
| dc.identifier | http://arxiv.org/abs/0808.1125 | |
| dc.identifier | ICGA Journal, International Computer Games Association, Vol. 25, No. 3, pp. 153--161, September 2002 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166694 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.8 | |
| dc.title | Verified Null-Move Pruning | |
| dc.type | text |