A combinatorial game is a type of mathematical game where two players take turns making moves from a finite set of options. The game is defined by its rules, which determine how players can interact with the game state. The objective is typically to force the opponent into a position where they cannot make a legal move, thereby winning the game. These games often involve strategic thinking and planning, as players must anticipate their opponent's moves. Examples of combinatorial games include chess, checkers, and Nim. They are studied in the field of game theory, which analyzes the strategies and outcomes of competitive situations.