Job-Level Proof Number Search

This paper introduces an approach, called generic job-level search, to leverage the game-playing programs which are already written and encapsulated as jobs. Such an approach is well suited to a distributed computing environment, since these jobs are allowed to be run by remote processors independently. In this paper, we present and focus on a job-level proof number search (JL-PNS), a kind of generic job-level search for solving computer game search problems, and apply JL-PNS to solving automatically several Connect6 positions, including some difficult openings. This paper also proposes a method of postponed sibling generation to generate nodes smoothly, and some policies, such as virtual win, virtual loss, virtual equivalence, flagging, or hybrids of the above, to expand the nodes. Our experiment compared these policies, and the results showed that the virtual-equivalence policy, together with flagging, performed the best against other policies. In addition, the results also showed that the speedups for solving these positions are 8.58 on average on 16 cores.

[1]  I-Chen Wu,et al.  NCTU6 WINS CONNECT6 TOURNAMENT , 2006 .

[2]  H. Jaap van den Herik,et al.  GO‐MOKU SOLVED BY NEW SEARCH TECHNIQUES , 1996, Comput. Intell..

[3]  I-Chen Wu,et al.  THE 2010 TAAI COMPUTER-GAME TOURNAMENTS , 2011 .

[4]  I-Chen Wu,et al.  Job-Level Proof-Number Search for Connect6 , 2010, Computers and Games.

[5]  Akihiro Kishimoto,et al.  DF-PN in Go: An Application to the One-Eye Problem , 2003, ACG.

[6]  Jakub Pawlewicz,et al.  Improving Depth-First PN-Search: 1 + epsilon Trick , 2006, Computers and Games.

[7]  H. Jaap van den Herik,et al.  Games solved: Now and in the future , 2002, Artif. Intell..

[8]  I-Chen Wu,et al.  NCTU6 Wins Man-Machine Connect6 Championship 2009 , 2009 .

[9]  Simon M. Lucas,et al.  A Survey of Monte Carlo Tree Search Methods , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[10]  H. Jaap van den Herik,et al.  Proof-Number Search , 1994, Artif. Intell..

[11]  Akihiro Kishimoto,et al.  Parallel AND/OR tree search based on proof and disproof numbers , 1999 .

[12]  Hiroyuki Iida,et al.  The PN*-search algorithm: Application to tsume-shogi , 2001, Artif. Intell..

[13]  I-Chen Wu,et al.  Temporal Difference Learning for Connect6 , 2011, ACG.

[14]  Olivier Teytaud,et al.  Meta Monte-Carlo Tree Search for Automatic Opening Book Generation , 2009 .

[15]  H. Jaap van den Herik,et al.  Parallel Monte-Carlo Tree Search , 2008, Computers and Games.

[16]  Nicolas Jouandeau,et al.  Solving breakthrough with Race Patterns and Job-Level Proof Number Search , 2011, ACG.

[17]  I-Chen Wu,et al.  A Volunteer-Computing-Based Grid Environment for Connect6 Applications , 2009, 2009 International Conference on Computational Science and Engineering.

[18]  I-Chen Wu,et al.  Relevance-Zone-Oriented Proof Search for Connect6 , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[19]  L. V. Allis,et al.  Searching for solutions in games and artificial intelligence , 1994 .

[20]  H. Jaap van den Herik,et al.  Randomized Parallel Proof-Number Search , 2009, ACG.

[21]  David Silver,et al.  Monte-Carlo tree search and rapid action value estimation in computer Go , 2011, Artif. Intell..

[22]  H. Jaap van den Herik,et al.  Proof-Number Search and Its Variants , 2008, Oppositional Concepts in Computational Intelligence.

[23]  I-Chen Wu,et al.  A New Family of k-in-a-Row Games , 2006, ACG.

[24]  I-Chen Wu,et al.  Connect6 , 2005, J. Int. Comput. Games Assoc..

[25]  I-Chen Wu,et al.  NCTU6-LITE WINS CONNECT6 TOURNAMENT , 2008 .

[26]  Gilles Fedak,et al.  XtremWeb: a generic global computing system , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[27]  Jonathan Schaeffer,et al.  Checkers Is Solved , 2007, Science.

[28]  H. Jaap van den Herik,et al.  PDS-PN: A New Proof-Number Search Algorithm , 2002, Computers and Games.

[29]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[30]  長井 歩,et al.  Df-pn algorithm for searching AND/OR trees and its applications , 2002 .

[31]  Jakub Pawlewicz Improving Depth-first PN-Search : 1 + ε Trick , 2006 .

[32]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[33]  Thomas Thomsen Lambda-Search in Game Trees - with Application to Go , 2000, Computers and Games.

[34]  Fritz Henglein,et al.  Clone detection using rolling hashing, suffix trees and dagification: A case study , 2012, 2012 6th International Workshop on Software Clones (IWSC).