Abstract
The paper presents a new proof-number (PN) search algorithm, called PDS–PN. It is a two-level search (like PN 2), 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 PN 2 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
