Deterministic Graphical Games Revisited

Starting from Zermelo’s classical formal treatment of chess, we trace through history the analysis of two-player win/lose/draw games with perfect information and potentially infinite play. Such chess-like games have appeared in many different research communities, and methods for solving them, such as retrograde analysis, have been rediscovered independently. We then revisit Washburn’s deterministic graphical games (DGGs), a natural generalization of chess-like games to arbitrary zero-sum payoffs. We study the complexity of solving DGGs and obtain an almost-linear time comparison-based algorithm for finding optimal strategies in such games. The existence of a linear time comparison-based algorithm remains an open problem.

[1]  N. Vieille.  Two-player stochastic games I: A reduction , 2000 .

[2]  Robert E. Tarjan,et al.  Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.

[3]  Christian Ewerhart,et al.  Backward Induction and the Game-Theoretic Analysis of Chess , 2002, Games Econ. Behav..

[4]  Abraham P. Punnen.  A fast algorithm for a class of bottleneck problems , 2005, Computing.

[5]  H. Bal,et al.  Solving the Game of Awari using Parallel Retrograde Analysis , 2003 .

[6]  R Bellman.  ON THE APPLICATION OF DYNAMIC PROGRAMING TO THE DETERMINATION OF OPTIMAL PLAY IN CHESS AND CHECKERS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Nicolas Vieille,et al.  Two-player stochastic games II: The case of recursive games , 2000 .

[8]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[9]  Dean Gillette,et al.  9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .

[10]  Henrik Björklund,et al.  A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discrete Applied Mathematics.

[11]  Paul Walker,et al.  Zermelo and the Early History of Game Theory , 2001, Games Econ. Behav..

[12]  Walter Ludwig,et al.  A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem , 1995, Inf. Comput..

[13]  L. Stiller.  Multilinear Algebra and Chess Endgames , 1996 .

[14]  Nir Halman,et al.  Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems , 2007, Algorithmica.

[15]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[16]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[17]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

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

[19]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[20]  S. Lippman,et al.  Stochastic Games with Perfect Information and Time Average Payoff , 1969 .

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

[22]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[23]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[24]  Akihiro Kishimoto,et al.  A General Solution to the Graph History Interaction Problem , 2004, AAAI.

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

[26]  F. A. Bostock,et al.  On Washburn's Deterministic Graphical Games , 1991 .

[27]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[28]  Alan R. Washburn,et al.  Deterministic graphical games , 1990 .

[29]  Peter Bro Miltersen,et al.  The Complexity of Solving Stochastic Games on Graphs , 2009, ISAAC.

[30]  Ken Thompson,et al.  Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..

[31]  Ernst A. Heinz.  Scalable search in computer chess: algorithmic enhancements and experiments at high search depths , 1999 .

[32]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[33]  Manuel Blum,et al.  Linear time bounds for median computations , 1972, STOC.

[34]  Krishnendu Chatterjee,et al.  Reduction of stochastic parity to stochastic mean-payoff games , 2008, Inf. Process. Lett..