Search Results for ""

A two-player game in which player 1 chooses any finite game and player 2 moves first. A pseudoparadox then arises as to whether the hypergame is itself a finite game.

A pile of counters in a game of nim. The nim-heap illustrated above corresponds to the game of Marienbad.

A game which is played by the following rules. Given one or more piles (nim-heaps), players alternate by taking all or some of the counters in a single heap. The player ...

A set of moves which a player plans to follow while playing a game.

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

A position in a game is safe for a player A if the person who plays next (player B) will lose.

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

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

A position in a game is unsafe for player A if the person who plays next (player B) can win. Every unsafe position can be made safe by at least one move.

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