Search Results for ""

The game of life is the best-known two-dimensional cellular automaton, invented by John H. Conway and popularized in Martin Gardner's Scientific American column starting in ...

A version of nim-like games in which the player taking the last piece is the loser. For most impartial games, this form is much harder to analyze, but it requires only a ...

A game played with two heaps of counters in which a player may take any number from either heap or the same number from both. The player taking the last counter wins. The rth ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

Let the elements in a payoff matrix be denoted a_(ij), where the is are player A's strategies and the js are player B's strategies. Player A can get at least min_(j<=n)a_(ij) ...

For n players, n-1 games are needed to fairly determine first place, and n-1+lg(n-1) are needed to fairly determine first and second place.

The ending of a game in which neither of two players wins, sometimes also called a "tie." A game in which no draw is possible is called a categorical game.

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 tetromino is a 4-polyomino. There are five free tetrominoes, seven one-sided tetrominoes, and 19 fixed tetrominoes. The free tetrominoes are known as the T-tetromino, ...