Search Results for ""
21 - 30 of 227 for Impartial gameSearch Results
The Game of Logic, described by Lewis Carroll--author of Alice in Wonderland--in 1887 (Carroll 1972) consists of discussing the meaning of propositions like "Some fresh cakes ...
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 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.
Every position of every impartial game has a nim-value, making it equivalent to a nim-heap. To find the nim-value (also called the Sprague-Grundy number), take the mex of the ...
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.
...
View search results from all Wolfram sites (29006 matches)

