Skip to content
Register Sign in Wishlist
Look Inside More Games of No Chance

More Games of No Chance

£39.99

Part of Mathematical Sciences Research Institute Publications

Elwyn Berlekamp, Dan Calistrate, Marc Paulhus, David Wolfe, John H. Conway, Matthew L. Ginsberg, David Moews, Noam D. Elkies, Greg Martin, Bill Spight, Takenobu Takizawa, Fabian Mäser, Solomon W. Golomb, Alfred W. Hales, Vadim V. Anshelevich, Scott Huddleston, Jerry Shurman, Ren Wu, Donald F. Beal, Martin Müller, Theodore Tegos, Aviezri S. Fraenkel, Michael Lachmann, Christopher Moore, Ivan Rapaport, Raymond Georg Snatzke, Katherine Scott, Alice Chan, Alice Tsai, David Eppstein, Erik D. Demaine, Martin L. Demaine, J. P. Grossman, Richard J. Nowakowski, Frank Harary, Wolfgang Slany, Oleg Verbitsky, Howard Landman, Therese C. Biedl, Rudolf Fleischer, Lars Jacobsen, Ian Munro, Helena A. Verrill, Richard K. Guy
View all contributors
  • Date Published: February 2011
  • availability: Available
  • format: Paperback
  • isbn: 9780521155632

£ 39.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This 2003 book provides an analysis of combinatorial games - games not involving chance or hidden information. It contains a fascinating collection of articles by some well-known names in the field, such as Elwyn Berlekamp and John Conway, plus other researchers in mathematics and computer science, together with some top game players. The articles run the gamut from theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to other games (Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex). Many of these advances reflect the interplay of the computer science and the mathematics. The book ends with a bibliography by A. Fraenkel and a list of combinatorial game theory problems by R. K. Guy. Like its predecessor, Games of No Chance, this should be on the shelf of all serious combinatorial games enthusiasts.

    • Presents results on hot games such as chess, Go, Hex, Amazons, and Chomp
    • Articles from top names in computer science and mathematics, such as Berlekamp, Conway, and Guy
    • Contains an annotated list of unsolved problems and a comprehensive bibliography
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: February 2011
    • format: Paperback
    • isbn: 9780521155632
    • length: 548 pages
    • dimensions: 234 x 156 x 28 mm
    • weight: 0.76kg
    • availability: Available
  • Table of Contents

    Part I. The Big Picture:
    1. Idempotents among partisan games Elwyn Berlekamp
    2. On the lattice Structure of finite games Dan Calistrate, Marc Paulhus and David Wolfe
    3. More infinite games John H. Conway
    4. Alpha-Beta pruning under partial orders Matthew L. Ginsberg
    5. The abstract structure of the group of games David Moews
    Part II. The Old Classics:
    6. Higher numbers in pawn endgames on large chessboards Noam D. Elkies
    7. Restoring fairness to Dukego Greg Martin
    8. Go thermography: the 4/21/98 Jiang-Rui endgame Bill Spight
    9. An application of mathematical game theory to go endgames: some width-two-entrance rooms with and without Kos Takenobu Takizawa
    10. Go endgames are PSPACE-hard David Wolfe
    11. Global threats in combinatorial games: a computation model with applications to chess endgames Fabian Mäser
    12. The games of hex: the hierarchical approach Vadim V. Anshelevich
    13. Hypercube tic-tac-toe Solomon W. Golomb and Alfred W. Hales
    14. Transfinite chomp Scott Huddleston and Jerry Shurman
    15. A memory efficient retrograde algorithm and its application to Chinese chess endgames Ren Wu and Donald F. Beal
    Part III. The New Classics:
    16: The 4G4G4G4G4 problems and solutions Elwyn Berlekamp
    17. Experiments in computer amazons Martin Müller and Theodore Tegos
    18. Exhaustive search in amazons Raymond Georg Snatzke
    19. Two-player games on cellular automata Aviezri S. Fraenkel
    20. Who wins domineering on rectangular boards? Michael Lachmann, Christopher Moore and Ivan Rapaport
    21. Forcing your opponent to stay in control of a loony dot-and-boxes endgame Elwyn Berlekamp and Katherine Scott
    22. 1 x n Konane: a summary of results Alice Chan and Alice Tsai
    23. 1-dimensional peg solitaire, and duotaire Christopher Moore and David Eppstein
    24. Phutball endgames are hard Erik D. Demaine, Martin L. Demaine and David Eppstein
    25. One-dimensional phutball J. P. Grossman and Richard J. Nowakowski
    26. A symmetric strategy in graph avoidance games Frank Harary, Wolfgang Slany and Oleg Verbitsky
    27. A simple FSM-based proof of the additive periodicity of the Sprague-Grundy function of Wythoff's games Howard Landman
    Part IV. Puzzles and Life:
    28. The complexity of clickomania Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen and Ian Munro
    29. Coin-moving puzzles Erik D. Demaine, Martin L. Demaine and Helena A. Verrill
    30. Searching for spaceships David Eppstein
    Part V: Surveys:
    31. Unsolved puzzles in combinatorial game theory: updated Richard K. Guy and Richard J. Nowakowski
    Bibliography of combinatorial games: updated Aviezri S. Fraenkel.

  • Editor

    Richard Nowakowski, Dalhousie University, Nova Scotia

    Contributors

    Elwyn Berlekamp, Dan Calistrate, Marc Paulhus, David Wolfe, John H. Conway, Matthew L. Ginsberg, David Moews, Noam D. Elkies, Greg Martin, Bill Spight, Takenobu Takizawa, Fabian Mäser, Solomon W. Golomb, Alfred W. Hales, Vadim V. Anshelevich, Scott Huddleston, Jerry Shurman, Ren Wu, Donald F. Beal, Martin Müller, Theodore Tegos, Aviezri S. Fraenkel, Michael Lachmann, Christopher Moore, Ivan Rapaport, Raymond Georg Snatzke, Katherine Scott, Alice Chan, Alice Tsai, David Eppstein, Erik D. Demaine, Martin L. Demaine, J. P. Grossman, Richard J. Nowakowski, Frank Harary, Wolfgang Slany, Oleg Verbitsky, Howard Landman, Therese C. Biedl, Rudolf Fleischer, Lars Jacobsen, Ian Munro, Helena A. Verrill, Richard K. Guy

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×