Perhaps the only misère combinatorial game played competitively in an organized forum is Sprouts.

In a discrete setting it can be interpreted as a stable configuration in a certain combinatorial game.

A game must meet several conditions to be a combinatorial game.

It is also a combinatorial game (when played with two players).

It is listed by Richard Guy as an important problem in the field of combinatorial games.

Games in which the difficulty of finding an optimal strategy stems from the multiplicity of possible moves are called combinatorial games.

The B* search algorithm has been used to compute optimal strategy in a sum game of a set of combinatorial games.

Nim, the classic combinatorial game where two players take turns choosing stones from piles, can be played with many variations.

A combinatorial game has a positive and negative player; which player moves first is left ambiguous.

Likewise, a combinatorial game is won (assuming optimal play) by the second player if and only if its value is 0.