Abstract
This paper proposes a new approach for proof number (PN) search, named job-level PN (JL-PN) search, where each search tree node is evaluated or expanded by a heavy-weight job, which takes normally over tens of seconds. Such JL-PN search is well suited for parallel processing, since these jobs are allowed to be performed by remote processors independently. This paper applies JL-PN search to solving automatically several Connect6 positions including openings on desktop grids. For some of these openings, so far no human expert had been able to find a winning strategy. Our experiments also show that the speedups for solving the test positions are roughly linear, fluctuating from sublinear to superlinear. Hence, JL-PN search appears to be a quite promising approach to solving games. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Wu, I. C., Lin, H. H., Lin, P. H., Sun, D. J., Chan, Y. C., & Chen, B. T. (2011). Job-level proof-number search for connect6. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6515 LNCS, pp. 11–22). https://doi.org/10.1007/978-3-642-17928-0_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
