# Partisan game

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Partisan_game
> Markdown URL: https://mediated.wiki/source/Partisan_game.md
> Source: https://en.wikipedia.org/wiki/Partisan_game
> Source revision: 1346446996
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

{{Short description|Combinatorial game with asymmetric players}}
In [combinatorial game theory](/source/combinatorial_game_theory), a game is '''partisan''' (sometimes '''partizan''') if it is not [impartial](/source/impartial_game). That is, some moves are available to one player and not to the other, or the payoffs are not symmetric.<ref>{{citation|title=Winning ways for your mathematical plays, Volume 1: Games in general|page=17|first1=Elwyn R.|last1=Berlekamp|author1-link=Elwyn Berlekamp|first2=John H.|last2=Conway|author2-link=John H. Conway|first3=Richard K.|last3=Guy|author3-link=Richard K. Guy|publisher=Academic Press|year=1982}}. Berlekamp et al. use the alternative spelling "partizan".</ref>

Most games are partisan. For example, in [chess](/source/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](/source/zugzwang).<ref>{{citation
 | last = Elkies | first = Noam D.|authorlink = Noam D. Elkies
 | contribution = On numbers and endgames: combinatorial game theory in chess endgames
 | location = Cambridge
 | mr = 1427963
 | pages = 135–150
 | publisher = Cambridge Univ. Press
 | series = Math. Sci. Res. Inst. Publ.
 | title = Games of no chance (Berkeley, CA, 1994)
 | volume = 29
 | year = 1996}}.</ref>

Partisan games are more difficult to analyze than [impartial game](/source/impartial_game)s, as the [Sprague–Grundy theorem](/source/Sprague%E2%80%93Grundy_theorem) does not apply.<ref>That is, not every position in a partisan game can have a [nimber](/source/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. {{citation
 | last = dos Santos | first = Carlos Pereira
 | doi = 10.1016/j.dam.2010.11.019
 | issue = 8
 | journal = Discrete Applied Mathematics
 | mr = 2782625
 | pages = 675–682
 | title = Embedding processes in combinatorial game theory
 | volume = 159
 | year = 2011| doi-access = free
 }}.</ref> 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.<ref>{{citation|title=On numbers and games|first=J. H.|last=Conway|authorlink=John H. Conway|publisher=Academic Press|year=1976}}.</ref>

==References==
{{reflist}}

{{DEFAULTSORT:Partisan Game}}
Category:Combinatorial game theory

---
Adapted from the Wikipedia article [Partisan game](https://en.wikipedia.org/wiki/Partisan_game) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Partisan_game?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.