Partisan game
In combinatorial game theory, a game is partisan if it is not impartial. That is, some moves are available to one player and not to the other.[1]
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.[2]
Partisan games are more difficult to analyze than impartial games, as the Sprague–Grundy theorem does not apply.[3] 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.[4]
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found.. Berlekamp et al. use the alternative spelling "partizan".
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ 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. Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This applied mathematics-related article is a stub. You can help Wikipedia by expanding it. |
