| Revision as of 22:14, 28 June 2006 editTreborbassett (talk | contribs)432 editsmNo edit summary← Previous edit | Revision as of 18:55, 22 November 2006 edit undoAlexb@cut-the-knot.com (talk | contribs)214 editsm added an external linkNext edit → | ||
| Line 6: | Line 6: | ||
| A game that is not impartial is called a ]. | A game that is not impartial is called a ]. | ||
| ==External link== | |||
| * | |||
| ] | ] | ||
Revision as of 18:55, 22 November 2006
In combinatorial game theory, an impartial game is a game in which the allowable moves depend only on the position and not on which of the two players is currently moving, and where the payoffs are symmetric. In other words, the only difference between player 1 and player 2 is that player 1 goes first.
Impartial games can be analyzed using the Sprague-Grundy theorem.
Impartial games include sprouts and nim. Chess, however, is not impartial, since one player can move only white pieces, and the other only black.
A game that is not impartial is called a partisan game.