Search Results for ""

A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...

A game in which the possible moves are the same for each player in any position. All positions in all impartial games form an additive Abelian group. For impartial games in ...

A problem also known as the points problem or unfinished game. Consider a tournament involving k players playing the same game repetitively. Each game has a single winner, ...

A game in which each player has a finite number of moves and a finite number of choices at each move.

Consider a game, first proposed by Nicolaus Bernoulli, in which a player bets on how many tosses of a coin will be needed before it first turns up heads. The player pays a ...

Dots and boxes is a two-person game based on a rectangular lattice of points. Each player, in turn, draws a horizontal or vertical line connecting two adjacent points. ...

Combinatorial game theory is the theory of two-player games of perfect knowledge such as go, chess, or checkers.

A game for which each player has a different set of moves in any position. Every position in an impartial game has a nim-value.

A class of game in which players move alternately and each player is completely informed of previous moves. Finite, zero-sum, two-player games with perfect information ...

An impartial game in which the last player wins. In normal-form games, the nim-value of the sum of two games is the nim-sum of their nim-values.