Enhanced Forward Pruning

M.H.M. Winands; H.J. van den Herik; J.W.H.M. Uiterwijk; Erik van der Werf

doi:10.1016/j.ins.2004.04.011

Enhanced Forward Pruning

M.H.M. Winands^*, H.J. van den Herik, J.W.H.M. Uiterwijk, Erik van der Werf

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

In this paper forward-pruning methods, such as multi-cut and null move, are tested at so-called ALL nodes. We improved the principal variation search by four small but essential additions. The new PVS algorithm guarantees that forward pruning is safe at ALL nodes. Experiments show that multi-cut at ALL nodes (MC-A) when combined with other forward-pruning mechanisms give a significant reduction of the number of nodes searched. In comparison, a (more) aggressive version of the null move (variable null-move bound) gives less reduction at expected ALL nodes. Finally, it is demonstrated that the playing strength of the lines of action program MIA is significantly (scoring 21% more winning points than the opponent) increased by MC-A.

Original language	English
Pages (from-to)	315-329
Journal	Information Sciences
Volume	175
Issue number	4
DOIs	https://doi.org/10.1016/j.ins.2004.04.011
Publication status	Published - 15 Nov 2005

Access to Document

10.1016/j.ins.2004.04.011

Cite this

@article{fca97a79bc4f4e9f960a5700e7918c9a,

title = "Enhanced Forward Pruning",

abstract = "In this paper forward-pruning methods, such as multi-cut and null move, are tested at so-called ALL nodes. We improved the principal variation search by four small but essential additions. The new PVS algorithm guarantees that forward pruning is safe at ALL nodes. Experiments show that multi-cut at ALL nodes (MC-A) when combined with other forward-pruning mechanisms give a significant reduction of the number of nodes searched. In comparison, a (more) aggressive version of the null move (variable null-move bound) gives less reduction at expected ALL nodes. Finally, it is demonstrated that the playing strength of the lines of action program MIA is significantly (scoring 21% more winning points than the opponent) increased by MC-A. ",

author = "M.H.M. Winands and {van den Herik}, H.J. and J.W.H.M. Uiterwijk and {van der Werf}, Erik",

year = "2005",

month = nov,

day = "15",

doi = "10.1016/j.ins.2004.04.011",

language = "English",

volume = "175",

pages = "315--329",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

number = "4",

}

TY - JOUR

T1 - Enhanced Forward Pruning

AU - Winands, M.H.M.

AU - van den Herik, H.J.

AU - Uiterwijk, J.W.H.M.

AU - van der Werf, Erik

PY - 2005/11/15

Y1 - 2005/11/15

N2 - In this paper forward-pruning methods, such as multi-cut and null move, are tested at so-called ALL nodes. We improved the principal variation search by four small but essential additions. The new PVS algorithm guarantees that forward pruning is safe at ALL nodes. Experiments show that multi-cut at ALL nodes (MC-A) when combined with other forward-pruning mechanisms give a significant reduction of the number of nodes searched. In comparison, a (more) aggressive version of the null move (variable null-move bound) gives less reduction at expected ALL nodes. Finally, it is demonstrated that the playing strength of the lines of action program MIA is significantly (scoring 21% more winning points than the opponent) increased by MC-A.

AB - In this paper forward-pruning methods, such as multi-cut and null move, are tested at so-called ALL nodes. We improved the principal variation search by four small but essential additions. The new PVS algorithm guarantees that forward pruning is safe at ALL nodes. Experiments show that multi-cut at ALL nodes (MC-A) when combined with other forward-pruning mechanisms give a significant reduction of the number of nodes searched. In comparison, a (more) aggressive version of the null move (variable null-move bound) gives less reduction at expected ALL nodes. Finally, it is demonstrated that the playing strength of the lines of action program MIA is significantly (scoring 21% more winning points than the opponent) increased by MC-A.

U2 - 10.1016/j.ins.2004.04.011

DO - 10.1016/j.ins.2004.04.011

M3 - Article

SN - 0020-0255

VL - 175

SP - 315

EP - 329

JO - Information Sciences

JF - Information Sciences

IS - 4

ER -