Search Results for ""

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

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 connection game is a board game in which players compete to develop or complete a type of topological connection with their pieces. This could involve forming a path ...

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 ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

A game in which no draw is possible. Steinhaus (1999, p. 16) stated that all categorical games are unfair, but this is incorrect. For example, the game "Odds or Evens" pits ...

Conway games were introduced by J. H. Conway in 1976 to provide a formal structure for analyzing games satisfying certain requirements: 1. There are two players, Left and ...

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...

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.

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