Combinatorial Game Theory

Author:   Aaron N. Siegel
Publisher:   American Mathematical Society
ISBN:  

9780821851906


Pages:   523
Publication Date:   30 August 2013
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $228.80 Quantity:  
Add to Cart

Share |

Combinatorial Game Theory


Add your own review!

Overview

Combinatorial game theory is the study of two-player games with no hidden information and no chance elements. The theory assigns algebraic values to positions in such games and seeks to quantify the algebraic and combinatorial structure of their interactions. Its modern form was introduced thirty years ago, with the publication of the classic Winning Ways for Your Mathematical Plays by Berlekamp, Conway, and Guy, and interest has rapidly increased in recent decades. This book is a comprehensive and up-to-date introduction to the subject, tracing its development from first principles and examples through many of its most recent advances. Roughly half the book is devoted to a rigorous treatment of the classical theory; the remaining material is an in-depth presentation of topics that appear for the first time in textbook form, including the theory of misere quotients and Berlekamp's generalised temperature theory. Packed with hundreds of examples and exercises and meticulously cross-referenced, Combinatorial Game Theory will appeal equally to students, instructors, and research professionals. More than forty open problems and conjectures are mentioned in the text, highlighting the many mysteries that still remain in this young and exciting field. Aaron Siegel holds a Ph.D. in mathematics from the University of California, Berkeley and has held positions at the Mathematical Sciences Research Institute and the Institute for Advanced Study. He was a partner at Berkeley Quantitative, a technology-driven hedge fund, and is presently employed by Twitter, Inc.

Full Product Details

Author:   Aaron N. Siegel
Publisher:   American Mathematical Society
Imprint:   American Mathematical Society
Weight:   1.095kg
ISBN:  

9780821851906


ISBN 10:   082185190
Pages:   523
Publication Date:   30 August 2013
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Preface Combinatorial games Short games The structure of 𝔾 Impartial games Misère play Loopy games Temperature theory Transfinite games Open problems Mathematical prerequisites A finite loopfree history Bibliography Glossary of notation Author index Index of games Index

Reviews

For those wishing to know about combinatorial games in depth this is the book to read. ...Chapter 1 and Appendix C alone are almost worth the price of the book. ...The author has kept the tone of the book light and infused it with history, anecdotes, and important observations making it an entertaining and as well as an educational read. -- MAA


For those wishing to know about combinatorial games in depth this is the book to read. ...Chapter 1 and Appendix C alone are almost worth the price of the book. ...The author has kept the tone of the book light and infused it with history, anecdotes, and important observations making it an entertaining and as well as an educational read. -- MAA


Author Information

Aaron N. Siegel, San Francisco, CA, USA.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List