Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Games of No Chance 3
  • Cited by 2
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      28 February 2011
      29 May 2009
      ISBN:
      9780511807251
      9780521861342
      9780521678544
      DOI:
      https://doi.org/10.1017/CBO9780511807251
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.95kg, 586 Pages
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.83kg, 586 Pages
      • Subjects:
      Mathematics, Real and Complex Analysis, Discrete Mathematics Information Theory and Coding
      Series:
      Mathematical Sciences Research Institute Publications (56)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics, Real and Complex Analysis, Discrete Mathematics Information Theory and Coding
    Series:
    Mathematical Sciences Research Institute Publications (56)
    Information

    Book description

    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.

    Reviews

    '… [suitable] for the curious and interested novice, as well as the expert who is looking for new challenges. It is a must-read for anyone interested in the current state of the theory of combinatorial games.'

    Source: Computing Reviews

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Page 1 of 2

    Contents

    Page 1 of 2

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.