ABSTRACT
In this chapter we present the definitions and complexity proofs for Team Private Constraint Logic, both the bounded and unbounded varieties.
Complexity Background. It turns out that adding players beyond two to a game does not increase the complexity of the standard decision question, “does player X have a forced win?” We might as well assume that all the other players team up to beat X , in which case we effectively have a two-player game again. If we generalize the notion of the decision question somewhat, we do obtain new kinds of games. In a team game, there are still two “sides,” but each side can have multiple players, and the decision question is whether team X has a forced win. A team wins if any of its players wins.
