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 journalArticleAcademicpeer-review

7 Citations (Web of Science)


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 languageEnglish
Pages (from-to)315-329
JournalInformation Sciences
Issue number4
Publication statusPublished - 15 Nov 2005

Cite this