Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist
Games of No Chance

Games of No Chance

$64.99

Part of Mathematical Sciences Research Institute Publications

John H. Conway, Aviezri Fraenkel, Richard K. Guy, Julian West, David Wolfe, Ralph Gasser, Jonathan Schaeffer, Robert Lake, Noam D. Elkies, Lewis Stiller, Yasuhito Kawano, Elwyn Berlekamp, Yonghoan Kim, Howard A. Landman, David Moews, Martin Müller, Jeff Erickson, Dan Garcia, Richard J. Nowakowski, David G. Poole, Hilarie K. Orman, Michael Zieve, David Blackwell, Dan Calistrate, Hiroyuki Iida, Yoshiyuki Kotani, Jos W. H. M. Uiterwijk, James G. Propp, Andrew J. Lazarus, Daniel E. Loeb, Daniel Ullman
View all contributors
  • Date Published: November 1998
  • availability: Available
  • format: Paperback
  • isbn: 9780521646529

$64.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Is Nine-Men's Morris, in the hands of perfect players, a win for white or for black--or a draw? Can king, rook, and knight always defeat king and two knights in chess? What can Go players learn from economists? What are nimbers, tinies, switches, minies? This book deals with combinatorial games, that is, games not involving chance or hidden information. Their study is at once old and young: though some games, such as chess, have been analyzed for centuries, the first full analysis of a nontrivial combinatorial game (Nim) only appeared in 1902. This book deals with combinatorial games, that is, games not involving chance or hidden information. Their study is at once old and young: though some games, such as chess, have been analyzed for centuries, the first full anlaysis of a nontrivial combinatorial game (Nim) only appeared in 1902. The first part of this book will be accessible to anyone, regardless of background: it contains introductory expositions, reports of unusual contest between an angel and a devil. For those who want to delve more deeply, the book also contains combinatorial studies of chess and Go; reports on computer advances such as the solution of Nine-Men's Morris and Pentominoes; and new theoretical approaches to such problems as games with many players. If you have read and enjoyed Martin Gardner, or if you like to learn and analyze new games, this book is for you.

    • Presents the mathematics behind popular games such as checkers, chess, and Go in articles by top names in the field
    • First two parts are written for a general audience, later chapters present research findings
    • Contains an annotated list of unsolved problems and a comprehensive bibliography
    Read more

    Reviews & endorsements

    "This book must be read by every serious student of two-person full-information games, and it provides an excellent presentation for anyone seeking a proper introduction to the subject." Solomon W. Golomb, American Scientist

    "Some books make mathematics look like so much fun! This collection of 35 articles and a comprehensive bibliography is a marvelous and alluring account of a 1994 MSRI two week workshop on combinatorial game theory. This could be a menace to the rest of mathematics; those folks seem to be having such a good time playing games that the rest of us might abandon 'serious' mathematics and join the party...Even the technical terms are laced with humor." Ed Sandifer, MAA Online

    See more reviews

    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: November 1998
    • format: Paperback
    • isbn: 9780521646529
    • length: 552 pages
    • dimensions: 234 x 156 x 28 mm
    • weight: 0.77kg
    • contains: 199 b/w illus. 49 tables
    • availability: Available
  • Table of Contents

    Part I. All Games Bright and Beautiful:
    1. The angel problem John H. Conway
    2. Scenic trails ascending from sea-level Nim to Alpine chess Aviezri Fraenkel
    3. What is a game? Richard K. Guy
    4. Impartial games Richard K. Guy
    5. Championship-level play of dots-and-boxes Julian West
    6. Championship-level play of domineering Julian West
    7. The gamesman's toolkit David Wolfe
    Part II. Strides on Classical Ground:
    8. Solving Nine Men's Morris Ralph Gasser
    9. Marion Tinsley: human perfection at checkers? Jonathan Schaeffer
    10. Solving the game of checkers Jonathan Schaeffer and Robert Lake
    11. On numbers and endgames: combinatorial game theory in chess endgames Noam D. Elkies
    12. Multilinear algebra and chess endgames Lewis Stiller
    13. Using similar positions to search game trees Yasuhito Kawano
    14. Where is the 'Thousand-Dollar Ko'? Elwyn Berlekamp and Yonghoan Kim
    15. Eyespace values in Go Howard A. Landman
    16. Loopy games and Go David Moews
    17. Experiments in computer Go endgames Martin Müller and Ralph Gasser
    Part III. Taming the Menagerie:
    18. Sowing games Jeff Erickson
    19. New toads and frogs results Jeff Erickson
    20. X-dom: a graphical, x-based front-end for domineering Dan Garcia
    21. Infinitesimals and coin-sliding David Moews
    22. Geography played on products of directed cycles Richard J. Nowakowski and David G. Poole
    23. Pentominoes: a first player win Hilarie K. Orman
    24. New values for top entails Julian West
    25. Take-away games Michael Zieve
    Part IV. New Theoretical Vistas:
    26. The economist's view of combinatorial games Elwyn Berlekamp
    27. Games with infinitely many moves and slightly imperfect information (extended abstract) David Blackwell
    28. The reduced canonical form of a game Dan Calistrate
    29. Error-correcting codes derived from combinatorial games Aviezri Fraenkel
    30. Tutoring strategies in game-tree search (extended abstract) Hiroyuki Iida, Yoshiyuki Kotani and Jos W. H. M. Uiterwijk
    31. About David Richman James G. Propp
    32. Richman games Andrew J. Lazarus, Daniel E. Loeb, James G. Propp and Daniel Ullman
    33. Stable winning coalitions Daniel E. Loeb
    Part V. Coda:
    34. Unsolved problems in combinatorial games Richard K. Guy
    35. Combinatorial games: selected bibliography with a succinct gourmet introduction Aviezri Fraenkel.

  • Editor

    Richard J. Nowakowski, Dalhousie University, Nova Scotia

    Contributors

    John H. Conway, Aviezri Fraenkel, Richard K. Guy, Julian West, David Wolfe, Ralph Gasser, Jonathan Schaeffer, Robert Lake, Noam D. Elkies, Lewis Stiller, Yasuhito Kawano, Elwyn Berlekamp, Yonghoan Kim, Howard A. Landman, David Moews, Martin Müller, Jeff Erickson, Dan Garcia, Richard J. Nowakowski, David G. Poole, Hilarie K. Orman, Michael Zieve, David Blackwell, Dan Calistrate, Hiroyuki Iida, Yoshiyuki Kotani, Jos W. H. M. Uiterwijk, James G. Propp, Andrew J. Lazarus, Daniel E. Loeb, Daniel Ullman

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 cflack@cambridge.org

Register Sign in
Please note that an additional password is required to open the solutions file once you have downloaded it. Contact collegesales@cambridge.org for this password.

» 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 ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

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.
×