GPU Exploration of Two-Player Games with Perfect Hash Functions

In this paper we improve solving two-player games by computing the game-theoretical value of every reachable state. A graphics processing unit located on the graphics card is used as a co-processor to accelerate the solution process. We exploit perfect hash functions to store the game states efficiently in memory and to transfer their ordinal representation between the host and the graphics card. As an application we validate Gasser's results that Nine-Men-Morris is a draw on a personal computer. Moreover, our solution is strong, while for the opening phase Gasser only provided a weak solution.

[1]  Jens H. Krüger,et al.  A Survey of General‐Purpose Computation on Graphics Hardware , 2007, Eurographics.

[2]  Frank Ruskey,et al.  Ranking and unranking permutations in linear time , 2001, Inf. Process. Lett..

[3]  Robert Strzodka,et al.  Using GPUs to improve multigrid solver performance on a cluster , 2008, Int. J. Comput. Sci. Eng..

[4]  Robert Lake,et al.  Solving Large Retrograde Analysis Problems Using a Network of Workstations , 1993 .

[5]  Richard E. Korf,et al.  A Divide and Conquer Bidirectional Search: First Results , 1999, IJCAI.

[6]  Richard E. Korf.  Minimizing Disk I/O in Two-Bit Breadth-First Search , 2008, AAAI.

[7]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[8]  Anjul Patney,et al.  Efficient computation of sum-products on GPUs through software-managed cache , 2008, ICS '08.

[9]  Stefan Edelkamp,et al.  Perfect Hashing for State Space Exploration on the GPU , 2010, ICAPS.

[10]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[11]  Gene Cooperman,et al.  New Methods for Using Cayley Graphs in Interconnection Networks , 1992, Discret. Appl. Math..

[12]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[13]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[14]  Ralph Gasser,et al.  SOLVING NINE MEN'S MORRIS , 1996, Comput. Intell..

[15]  Martin Mares,et al.  Linear-Time Ranking of Permutations , 2007, ESA.

[16]  Henri E. Bal,et al.  Solving awari with parallel retrograde analysis , 2003, Computer.

[17]  Richard E. Korf,et al.  Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment , 2000, AAAI/IAAI.

[18]  Richard E. Korf,et al.  Large-Scale Parallel Breadth-First Search , 2005, AAAI.