An effective two-level proof-number search algorithm |
| |
Affiliation: | Department of Computer Science, Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, Maastricht 6200 MD, Netherlands |
| |
Abstract: | The paper presents a new proof-number (PN) search algorithm, called PDS–PN. It is a two-level search (like PN2), which performs at the first level a depth-first proof-number and disproof-number search (PDS), and at the second level a best-first PN search. Hence, PDS–PN selectively exploits the power of both PN2 and PDS. Experiments in the domain of Lines of Action are performed. They show that within an acceptable time frame PDS–PN is more effective for really hard endgame positions than αβ and any other PN-search algorithm. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|