Games of no chance 4

By:

Nowakowski, Richard J. (Ed.)

Series: Mathematical Sciences Research Institute Publications ; 63Publication details: New York: Cambridge University Press, 2015.Description: x, 339 p.: hbk.: 24 cmISBN:

9781107011038

Subject(s):

DDC classification:

519.3 NOW 23

Summary: Combinatorial games are the strategy games that people like to play, for example chess, Hex, and Go. They differ from economic games in that there are two players who play alternately with no hidden cards and no dice. These games have a mathematical structure that allows players to analyse them in the abstract. Games of No Chance 4 contains the first comprehensive explorations of misère (last player to move loses) games, extends the theory for some classes of normal-play (last player to move wins) games and extends the analysis for some specific games. It includes a tutorial for the very successful approach to analysing misère impartial games and the first attempt at using it for misère partisan games. Hex and Go are featured, as well as new games: Toppling Dominoes and Maze. Updated versions of Unsolved Problems in Combinatorial Game Theory and the Combinatorial Games Bibliography complete the volume. Includes a tutorial for the misère quotient approach to misère impartial games Introduces a misère quotient approach for misère partizan games Features new techniques used for analysing games https://www.cambridge.org/in/universitypress/subjects/mathematics/discrete-mathematics-information-theory-and-coding/games-no-chance-4?format=HB&isbn=9781107011038

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Barcode
Books	IIT Gandhinagar	General	519.3 NOW (Browse shelf(Opens below))	1	Available	035333

Browsing IIT Gandhinagar shelves,Collection: General Close shelf browser (Hides shelf browser)

Previous								Next
Previous	519.3 DEV Game theory: a playful introduction	519.3 FAT Infinite dimensional optimization and control theory, Vol. 62	519.3 HAY Hex, inside and out: the full story	519.3 NOW Games of no chance 4	519.3 NOW More games of no chance	519.3 PAR Stochastic games and related concepts	519.3 ROU Algorithms illuminated	Next

Includes Bibliographical References

Combinatorial games are the strategy games that people like to play, for example chess, Hex, and Go. They differ from economic games in that there are two players who play alternately with no hidden cards and no dice. These games have a mathematical structure that allows players to analyse them in the abstract. Games of No Chance 4 contains the first comprehensive explorations of misère (last player to move loses) games, extends the theory for some classes of normal-play (last player to move wins) games and extends the analysis for some specific games. It includes a tutorial for the very successful approach to analysing misère impartial games and the first attempt at using it for misère partisan games. Hex and Go are featured, as well as new games: Toppling Dominoes and Maze. Updated versions of Unsolved Problems in Combinatorial Game Theory and the Combinatorial Games Bibliography complete the volume.

Includes a tutorial for the misère quotient approach to misère impartial games
Introduces a misère quotient approach for misère partizan games
Features new techniques used for analysing games

https://www.cambridge.org/in/universitypress/subjects/mathematics/discrete-mathematics-information-theory-and-coding/games-no-chance-4?format=HB&isbn=9781107011038

There are no comments on this title.

to post a comment.