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 language | English |
---|---|
Title of host publication | Proceedings of the 7th Joint Conference on Information Sciences (JCIS 2003) |
Editors | P. . Wang |
Publisher | JCIS/Association for Intelligent Machinery, Inc, USA |
Pages | 485-488 |
Publication status | Published - 1 Jan 2003 |
Event | conference; 2003-01-01; 2003-01-01 - Duration: 1 Jan 2003 → 1 Jan 2003 |
Conference
Conference | conference; 2003-01-01; 2003-01-01 |
---|---|
Period | 1/01/03 → 1/01/03 |