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: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

In this paper forward-pruning methods, such as multicut and null move, are tested at so-called ALL nodes. A modified version of the Principal Variation Search is introduced. It guarantees that forward pruning is safe at ALL nodes. Experiments show that multi-cut at ALL nodes, MC-A, in combination with other forward-pruning mechanisms give a significant reduction of the number of nodes searched. The playing strength of the Lines of Action program MIA is significantly increased by MC-A.
Original languageEnglish
Title of host publicationProceedings of the 7th Joint Conference on Information Sciences (JCIS 2003)
EditorsP. . Wang
PublisherJCIS/Association for Intelligent Machinery, Inc, USA
Pages485-488
Publication statusPublished - 1 Jan 2003
Eventconference; 2003-01-01; 2003-01-01 -
Duration: 1 Jan 20031 Jan 2003

Conference

Conferenceconference; 2003-01-01; 2003-01-01
Period1/01/031/01/03

Fingerprint

Dive into the research topics of 'Enhanced Forward Pruning'. Together they form a unique fingerprint.

Cite this