No label defined (Q3973044)

[For the entire collection see Zbl 0721.00028.] In this very readable paper, the author, a noted expert in combinatorial games, provides a useful survey of combinatorial games and their computational complexity; e.g., Nim-Like Games, Games with Draws, Generalized Sprague-Grundy Functions, Annihilation Games, and Provably and Conditionally Intractable Games. Basic notions of computational complexity in terms of deterministic and non-deterministic Turing machine computations are also presented in addition to the author's survey of combinatorial games, and can provide the basis for further inquiry by a reader relatively unfamiliar with this material. What the reviewer found to be rather interesting to game-theorists in general is the author's graph-theoretic proof by reduction ad absurdum of the Zermelo-von Neumann theorem for 2-person, deterministic, perfect information games whose game-graph may be infinite.