Search Results for ""

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

A game is defined as a conflict involving gains and losses between two or more opponents who follow formal rules. The study of games belongs to a branch of mathematics known ...

A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.

A game which permits a draw ("tie") when played properly by both players. Tic-tac-toe, for example, is a futile game.

A game in which a certain player can always win when he plays properly. All categorical games are unfair (Steinhaus 1999, p. 16), as is the game of Marienbad.

The solution to a game in game theory. When a game saddle point is present max_(i<=m)min_(j<=n)a_(ij)=min_(j<=n)max_(i<=m)a_(ij)=v, and v is the value for pure strategies.

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