ABSTRACT
In this chapter we describe all the specific kinds of constraint-logic games in detail. In each case-from bounded zero-player games all the way to unbounded team games-we show how an appropriate kind of constraint logic can be viewed as a canonical game for that category. We state, without proving, the computational power (equivalently, computationalcomplexity class) of each game type, and give the simplest set of “basis vertex” types needed to show that specific games are hard. Armed with this information the reader may, if he desires, skip ahead to Part II fully prepared to understand the given reductions. All of the results stated here are summarized even more concisely in Table D.1.
