Most games are partisan. For example, in chess, only one player can move the white pieces. More strongly, when analyzed using combinatorial game theory, many chess positions have values that cannot be expressed as the value of an impartial game, for instance when one side has a number of extra tempos that can be used to put the other side into zugzwang.
Partisan games are more difficult to analyze than impartial games, as the Sprague–Grundy theorem does not apply. However, the application of combinatorial game theory to partisan games allows the significance of numbers as games to be seen, in a way that is not possible with impartial games.
- Berlekamp, Elwyn R.; Conway, John H.; Guy, Richard K. (1982), Winning ways for your mathematical plays, Volume 1: Games in general, Academic Press, p. 17. Berlekamp et al. use the alternative spelling "partizan".
- Elkies, Noam D. (1996), "On numbers and endgames: combinatorial game theory in chess endgames", Games of no chance (Berkeley, CA, 1994), Math. Sci. Res. Inst. Publ. 29, Cambridge: Cambridge Univ. Press, pp. 135–150, MR 1427963.
- That is, not every position in a partisan game can have a nimber as its value, or else the game would be impartial. However, some nimbers can still occur as the values of game positions; see e.g. dos Santos, Carlos Pereira (2011), "Embedding processes in combinatorial game theory", Discrete Applied Mathematics 159 (8): 675–682, doi:10.1016/j.dam.2010.11.019, MR 2782625.
- Conway, J. H. (1976), On numbers and games, Academic Press.
|This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.|