000			01514 a2200205 4500
008			161214b xxu||||| |||| 00| 0 eng d
020			_a9780521678544
082			_a519.3/ _bAlb/Now
100			_aAlbert, Michael H. (Ed.)
245			_aGames of no. chance 3
260			_c2009 _bCambridge University Press _aCambridge
300			_ax; 575p. _c9x6
440			_aMathematical Sciences Research Institute Publications
520			_aThis 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.
546			_aENG
650			_aGame theory-Congresses
650			_aCombinatorial analysis-Congresses
700			_aNowakowski, Richard L. (Ed.)
942			_cBK
999			_c85114 _d85114