Games of no chance

Author(s)

Bibliographic Information

Games of no chance

edited by Michael H. Albert, Richard J. Nowakowski

（Mathematical Sciences Research Institute publications, 56, 63, 70）

Cambridge University Press, 2009-

  • 3 : hbk
  • 3 : pbk
  • 4 : hbk
  • 5 : hardback

Available at  / 45 libraries

Search this Book/Journal

Note

[Vol.] 4: edited by Richard J. Nowakowski

[Vol.] 5: edited by Urban Larsson

[Vol.] 4: Some copies published in New York

[Vol.] 3: Includes bibliographical references (p. 499-575)

[Vol.] 4: Includes bibliographical references

[Vol.] 5: Includes bibliographical references and index

Description and Table of Contents

Volume

3 : pbk ISBN 9780521678544

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.

Table of Contents

  • Part I. Surveys: 1. Playing games with algorithms: algorithmic combinatorial game theory Erik D. Demaine and Robert A. Hearn
  • 2. Advances in losing Thane E. Plambeck
  • 3. Coping with cycles Aaron N. Siegel
  • 4. On day N David Wolfe
  • Part II. Standards: 5. Goal threats, temperature and Monte-Carlo Go Tristan Cazenave
  • 6. A puzzling hex primer Ryan B. Hayward
  • 7. Tigers and goats is a draw Lim Yew Jin and Jurg Nievergelt
  • 8. Counting liberties in Go capturing races Teigo Nakamura
  • 9. Backsliding toads and frogs Aaron N. Siegel
  • 10. Loopy games Aaron N. Siegel
  • 11. A library of eyes in Go, I: a life-and-death definition consistent with bent-4 Thomas Wolf
  • 12. A library of eyes in Go, II: monolithic eyes Thomas Wolf and Matthew Pratola
  • Part III. Complexity: 13. The complexity of Dyson telescopes Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Robert A. Hearn and Timo von Oertzen
  • 14. Amazons, konane, and cross purposes are PSPACE-complete Robert A. Hearn
  • Part IV. Impartial: 15. Monotonic sequence games M. H. Albert, R. E. L. Aldred, M. D. Atkinson, C. C. Handley, D. A. Holton, D. J. Mccaughan and B. E. Sagan
  • 16. The game of End-Wythoff Aviezri S. Fraenkel and Elnatan Reisner
  • 17. On the geometry of combinatorial games: a renormalization approach Eric J. Friedman and Adam S. Landsberg
  • 18. More on the Sprague-Grundy function for Wythoff's game Gabriel Nivasch
  • Part V. Theory of the Small: 19. Yellow-brown hackenbush Elwyn Berlekamp
  • 20. Ordinal partizan end Nim Adam Duffy, Garrett Kolpin and David Wolfe
  • 21. Reductions of partizan games J. P. Grossman and Aaron N. Siegel
  • 22. Partizan Splittles G. A. Mesdal III
  • Part VI. Columns: 23. Unsolved problems in combinatorial games Richard K. Guy and Richard J. Nowakowski
  • 24. Bibliography of combinatorial games Aviezri S. Fraenkel.
Volume

3 : hbk ISBN 9780521861342

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.

Table of Contents

  • Part I. Surveys: 1. Playing games with algorithms: algorithmic combinatorial game theory Erik D. Demaine and Robert A. Hearn
  • 2. Advances in losing Thane E. Plambeck
  • 3. Coping with cycles Aaron N. Siegel
  • 4. On day N David Wolfe
  • Part II. Standards: 5. Goal threats, temperature and Monte-Carlo Go Tristan Cazenave
  • 6. A puzzling hex primer Ryan B. Hayward
  • 7. Tigers and goats is a draw Lim Yew Jin and Jurg Nievergelt
  • 8. Counting liberties in Go capturing races Teigo Nakamura
  • 9. Backsliding toads and frogs Aaron N. Siegel
  • 10. Loopy games Aaron N. Siegel
  • 11. A library of eyes in Go, I: a life-and-death definition consistent with bent-4 Thomas Wolf
  • 12. A library of eyes in Go, II: monolithic eyes Thomas Wolf and Matthew Pratola
  • Part III. Complexity: 13. The complexity of Dyson telescopes Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Robert A. Hearn and Timo von Oertzen
  • 14. Amazons, konane, and cross purposes are PSPACE-complete Robert A. Hearn
  • Part IV. Impartial: 15. Monotonic sequence games M. H. Albert, R. E. L. Aldred, M. D. Atkinson, C. C. Handley, D. A. Holton, D. J. Mccaughan and B. E. Sagan
  • 16. The game of End-Wythoff Aviezri S. Fraenkel and Elnatan Reisner
  • 17. On the geometry of combinatorial games: a renormalization approach Eric J. Friedman and Adam S. Landsberg
  • 18. More on the Sprague-Grundy function for Wythoff's game Gabriel Nivasch
  • Part V. Theory of the Small: 19. Yellow-brown hackenbush Elwyn Berlekamp
  • 20. Ordinal partizan end Nim Adam Duffy, Garrett Kolpin and David Wolfe
  • 21. Reductions of partizan games J. P. Grossman and Aaron N. Siegel
  • 22. Partizan Splittles G. A. Mesdal III
  • Part VI. Columns: 23. Unsolved problems in combinatorial games Richard K. Guy and Richard J. Nowakowski
  • 24. Bibliography of combinatorial games Aviezri S. Fraenkel.
Volume

4 : hbk ISBN 9781107011038

Description

Combinatorial games are the strategy games that people like to play, for example chess, Hex, and Go. They differ from economic games in that there are two players who play alternately with no hidden cards and no dice. These games have a mathematical structure that allows players to analyse them in the abstract. Games of No Chance 4 contains the first comprehensive explorations of misere (last player to move loses) games, extends the theory for some classes of normal-play (last player to move wins) games and extends the analysis for some specific games. It includes a tutorial for the very successful approach to analysing misere impartial games and the first attempt at using it for misere partisan games. Hex and Go are featured, as well as new games: Toppling Dominoes and Maze. Updated versions of Unsolved Problems in Combinatorial Game Theory and the Combinatorial Games Bibliography complete the volume.

Table of Contents

  • 1. Peeking at partizan misere quotients Meghan R. Allen
  • 2. A survey about solitaire clobber Laurent Beaudou, Eric Duchene and Sylvain Gravier
  • 3. Monte-Carlo approximation of temperature Tristan Cazenave
  • 4. Retrograde analysis of woodpush Tristan Cazenave and Richard J. Nowakowski
  • 5. Narrow misere dots-and-boxes Sebastien Collette, Erik D. Demaine, Martin L. Demaine and Stefan Langerman
  • 6. Toppling conjectures Alex Fink, Richard J. Nowakowski, Aaron Siegel and David Wolfe
  • 7. Harnessing the unwieldy MEX function Aviezri Fraenkel and Udi Peled
  • 8. The rat game and the mouse game Aviezri Fraenkel
  • 9. A ruler regularity in hexadecimal games J. P. Grossman and Richard J. Nowakowski
  • 10. A handicap strategy for hex Philip Henderson and Ryan Hayward
  • 11. Restrictions of m-wythoff nim and p-complementary Beatty sequences Urban Larsson
  • 12. Computer analysis of sprouts with nimbers Julien Lemoine and Simon Viennot
  • 13. Navigating the MAZE Neil McKay, Richard J. Nowakowski and Angela Siegel
  • 14. Evaluating territories of Go positions with capturing races Teigo Nakamura
  • 15. Artificial intelligence for bidding Hex Sam Payne and Elina Robeva
  • 16. Nimbers in partizan games Carlos Pereira Dos Santos and Jorge Nuno Silva
  • 17. Misere canonical forms of partizan games Aaron Siegel
  • 18. The structure and classification of misere quotients Aaron Siegel
  • 19. An algorithm for computing indistinguishability quotients in misere impartial combinatorial games Mike Weimerskirch
  • 20. Unsolved problems in combinatorial games Richard J. Nowakowski
  • 21. Combinatorial games: selected short bibliography with a succinct gourmet introduction Aviezri Fraenkel and Richard J. Nowakowski.
Volume

5 : hardback ISBN 9781108485807

Description

This book surveys the state-of-the-art in the theory of combinatorial games, that is games not involving chance or hidden information. Enthusiasts will find a wide variety of exciting topics, from a trailblazing presentation of scoring to solutions of three piece ending positions of bidding chess. Theories and techniques in many subfields are covered, such as universality, Wythoff Nim variations, misere play, partizan bidding (a.k.a. Richman games), loopy games, and the algebra of placement games. Also included are an updated list of unsolved problems, extremely efficient algorithms for taking and breaking games, a historical exposition of binary numbers and games by David Singmaster, chromatic Nim variations, renormalization for combinatorial games, and a survey of temperature theory by Elwyn Berlekamp, one of the founders of the field. The volume was initiated at the Combinatorial Game Theory Workshop, January 2011, held at the Banff International Research Station.

Table of Contents

  • 1. About this book Urban Larsson
  • 2. Temperatures of games and coupons Elwyn Berlekamp
  • 3. Wythoff visions Eric Duchene, Aviezri Fraenkel, Vladimir Gurvich, Nhan Ho, Clark Kimberling and Urban Larsson
  • 4. Scoring games: the state of play Urban Larsson, Richard Nowakowski and Carlos Pereira dos Santos
  • 5. Restricted developments in partizan misere game theory Rebecca Milley and Gabriel Renault
  • 6. Unsolved problems in combinatorial games Richard Nowakowski
  • 7. Misere games and misere quotients Aaron Siegel
  • 8. An historical tour of binary and tours David Singmaster
  • 9. A note on polynomial profiles of placement games J. I. Brown, D. Cox, A. Hoefel, Neil McKay, Rebecca Milley, Richard Nowakowski and Angela A. Siegel
  • 10. A PSPACE-complete Graph Nim Kyle Burke and Olivia George
  • 11. A nontrivial surjective map onto the short Conway group Alda Carvalho and Carlos Pereira dos Santos
  • 12. Games and complexes I: transformation via ideals Sara Faridi, Svenja Huntemann and Richard Nowakowski
  • 13. Games and complexes II: weight games and Kruskal-Katona type bounds Sara Faridi, Svenja Huntemann and Richard Nowakowski
  • 14. Chromatic Nim finds a game for your solution Mike Fisher and Urban Larsson
  • 15. Take-away games on Beatty's theorem and the notion of k-invariance Aviezri Fraenkel and Urban Larsson
  • 16. Geometric analysis of a generalized Wythoff game Eric Friedman, Scott M. Garrabrant, Ilona Phipps-Morgan, Adam S. Landsberg and Urban Larsson
  • 17. Searching for periodicity in officers J. P. Grossman
  • 18. Good pass moves in no-draw HyperHex: two proverbs Ryan Hayward
  • 19. Conjoined games: Go-Cut and Sno-Go Melissa Huggan and Richard Nowakowski
  • 20. Impartial games whose rulesets produce continued fractions Urban Larsson and Mike Weimerskirch
  • 21. Endgames in bidding chess Urban Larsson and Johan Wastlund
  • 22. Phutball draws Sucharit Sarkar
  • 23. Scoring play combinatorial games Fraser Stewart
  • 24. Generalized misere play Mike Weimerskirch.

by "Nielsen BookData"

Related Books： 1-1 of 1

Details

Page Top