Combinatorial games are strategic games where two players take turns making moves from a finite set of options. The outcome is determined solely by the players' decisions, with no element of chance involved. Examples include games like Chess, Checkers, and Nim. The goal is typically to force the opponent into a position where they cannot make a legal move. These games are studied in the field of game theory, which analyzes the strategies and outcomes of competitive situations. Combinatorial games often involve mathematical concepts, such as winning positions and game values, to determine optimal strategies for players.