Games Of No Chance 3 (mathematical Sciences Research Institute Publications)
by Michael H. Albert /
2009 / English / PDF
5.6 MB Download
This fascinating look at combinatorial games, that is, games not
involving chance or hidden information, offers updates on standard
games such as Go and Hex, on impartial games such as Chomp and
Wythoff's Nim, and on aspects of games with infinitesimal values,
plus analyses of the complexity of some games and puzzles and
surveys on algorithmic game theory, on playing to lose, and on
coping with cycles. The volume is rounded out with an up-to-date
bibliography by Fraenkel and, for readers eager to get their hands
dirty, a list of unsolved problems by Guy and Nowakowski.
Highlights include some of Siegel's groundbreaking work on loopy
games, the unveiling by Friedman and Landsberg of the use of
renormalization to give very intriguing results about Chomp, and
Nakamura's "Counting Liberties in Capturing Races of Go." Like its
predecessors, this book should be on the shelf of all serious games
enthusiasts.
This fascinating look at combinatorial games, that is, games not
involving chance or hidden information, offers updates on standard
games such as Go and Hex, on impartial games such as Chomp and
Wythoff's Nim, and on aspects of games with infinitesimal values,
plus analyses of the complexity of some games and puzzles and
surveys on algorithmic game theory, on playing to lose, and on
coping with cycles. The volume is rounded out with an up-to-date
bibliography by Fraenkel and, for readers eager to get their hands
dirty, a list of unsolved problems by Guy and Nowakowski.
Highlights include some of Siegel's groundbreaking work on loopy
games, the unveiling by Friedman and Landsberg of the use of
renormalization to give very intriguing results about Chomp, and
Nakamura's "Counting Liberties in Capturing Races of Go." Like its
predecessors, this book should be on the shelf of all serious games
enthusiasts.