Abstract
Proof-Number Search (PNS) is a powerful method for solving games and game positions. Over the years, the research on PNS has steadily produced new insights and techniques. With multi-core processors becoming established in the recent past, the question of parallelizing PNS has gained new urgency. This article presents a new technique called Randomized Parallel Proof-Number Search (RPPNS) for parallelizing PNS on multi-core systems with shared memory. The parallelization is based on randomizing the move selection of multiple threads, which operate on the same search tree. RPPNS is tested on a set of complex Lines-of-Action endgame positions. Experiments show that RPPNS scales well. Four directions for future research are given. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Saito, J. T., Winands, M. H. M., & Van Den Herik, H. J. (2010). Randomized parallel Proof-Number Search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6048 LNCS, pp. 75–87). https://doi.org/10.1007/978-3-642-12993-3_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
