The authors show that there are underlying mathematical reasons for why games and puzzles are challenging (and perhaps why they are so much fun). They also show that games and puzzles can serve as powerful models of computation-quite different from the usual models of automata and circuits-offering a new way of thinking about computation. The appendices provide a substantial survey of all known results in the field of game complexity, serving as a reference guide for readers interested in the computational complexity of particular games, or interested in open problems about such complexities.

Summary:

1. Introduction

I. Games in General.

2. The Constraint-Logic Formalism

3. Constraint-Logic Games

4. Zero-Player Games (Simulations)

5. One-Player Games (Puzzles)

6. Two-Player Games

7. Team Games

8. Perspectives on Part I

II. Games in Particular.

9. One-Player Games (Puzzles)

11. Perspectives on Part II

12. Conclusions

Appendices.

1. Survey of Games and Their Complexities

2. Computational-Complexity Reference

3. Deterministic Constraint Logic Activation Sequences

4. Constraint-Logic Quick Reference