Unlocking potential with the best learning and research solutions

Look Inside

I want this title to be available as an eBook

Games of No Chance 4

Part of Mathematical Sciences Research Institute Publications

Editor: Richard J. Nowakowski, Dalhousie University, Nova Scotia

Meghan R. Allen, Laurent Beaudou, Eric Duchene, Sylvain Gravier, Tristan Cazenave, Richard J. Nowakowski, Sebastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Alex Fink, Aaron Siegel, David Wolfe, Aviezri Fraenkel, Udi Peled, J. P. Grossman, Philip Henderson, Ryan Hayward, Urban Larsson, Julien Lemoine, Simon Viennot, Neil McKay, Angela Siegel, Teigo Nakamura, Sam Payne, Elina Robeva, Carlos Pereira Dos Santos, Jorge Nuno Silva, Mike Weimerskirch

View all contributors

Date Published: April 2015
availability: Available
format: Hardback
isbn: 9781107011038

Rate & review

Hardback

Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Description

Contents

Resources

Courses

About the Authors

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 misère (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 misère impartial games and the first attempt at using it for misère 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.
- Includes a tutorial for the misère quotient approach to misère impartial games
- Introduces a misère quotient approach for misère partizan games
- Features new techniques used for analysing games
Read more
Customer reviews

Not yet reviewed
Be the first to review

Log in 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?

Reviews must contain at least 12 words about the product.

×

Product details
- Date Published: April 2015
- format: Hardback
- isbn: 9781107011038
- length: 350 pages
- dimensions: 234 x 156 x 21 mm
- weight: 0.6kg
- contains: 70 b/w illus. 23 tables
- availability: Available
Table of Contents
1. Peeking at partizan misère 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 misère 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. Misère canonical forms of partizan games Aaron Siegel
18. The structure and classification of misère quotients Aaron Siegel
19. An algorithm for computing indistinguishability quotients in misére 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.
Look Inside
Editor
Richard J. Nowakowski, Dalhousie University, Nova Scotia
Series editor Cam Learning use ONLY
Mathematical Sciences Research Institute
Contributors
Meghan R. Allen, Laurent Beaudou, Eric Duchene, Sylvain Gravier, Tristan Cazenave, Richard J. Nowakowski, Sebastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Alex Fink, Aaron Siegel, David Wolfe, Aviezri Fraenkel, Udi Peled, J. P. Grossman, Philip Henderson, Ryan Hayward, Urban Larsson, Julien Lemoine, Simon Viennot, Neil McKay, Angela Siegel, Teigo Nakamura, Sam Payne, Elina Robeva, Carlos Pereira Dos Santos, Jorge Nuno Silva, Mike Weimerskirch