 Combinatorial game theory

Combinatorial game theory is a branch of mathematics and theoretical computer science that studies games with perfect information, where two players take turns making moves and there is no element of chance. It focuses on two-player games that are typically played to a conclusion, meaning that the game ends in a win, loss, or draw. Examples of such games include chess, Go, Nim, and various other abstract and strategic games.