Let be a set of finite sequences such that any initial segment of an element of is in any element of is a proper initial segment of an element of . Then is called a game tree. Interpretation Each element of represents a valid game state after finitely many moves. The only valid moves are the ones that don’t leave .