000 02268nam a22003738i 4500
001 CR9780511807251
003 UkCbUP
005 20200124160226.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 101021s2009||||enk o ||1 0|eng|d
020 _a9780511807251 (ebook)
020 _z9780521861342 (hardback)
020 _z9780521678544 (paperback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA269
_b.G374 2009
082 0 0 _a519.3
_222
245 0 0 _aGames of no chance 3 /
_cedited by Michael H. Albert, Richard J. Nowakowski.
264 1 _aCambridge :
_bCambridge University Press,
_c2009.
300 _a1 online resource (x, 575 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aMathematical Sciences Research Institute publications
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
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.
650 0 _aGame theory
_vCongresses.
650 0 _aCombinatorial analysis
_vCongresses.
700 1 _aAlbert, Michael H.,
_eeditor.
700 1 _aNowakowski, Richard J.,
_eeditor.
776 0 8 _iPrint version:
_z9780521861342
830 0 _aMathematical Sciences Research Institute Publications.
856 4 0 _uhttps://doi.org/10.1017/CBO9780511807251
999 _c517224
_d517222