Picture 1 of 2
Gallery
Picture 1 of 2
Have one to sell?
More Games of No Chance Book Richard J Nowakowski Cambridge University Hardcover
US $18.00
ApproximatelyS$ 23.42
Condition:
“see pics. Looks great.”
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
US $4.47 (approx S$ 5.82) USPS Media MailTM.
Located in: Saint Paul, Minnesota, United States
Delivery:
Estimated between Thu, 6 Nov and Mon, 10 Nov to 94104
Returns:
No returns accepted.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:156871022152
Item specifics
- Condition
- Like New
- Seller Notes
- “see pics. Looks great.”
- Binding
- Hardcover
- Product Group
- Book
- Book Title
- More Games of No Chance
- Weight
- 2 lbs
- IsTextBook
- No
- ISBN
- 9780521808323
About this product
Product Identifiers
Publisher
Cambridge University Press
ISBN-10
0521808324
ISBN-13
9780521808323
eBay Product ID (ePID)
1939539
Product Key Features
Number of Pages
548 Pages
Language
English
Publication Name
More Games of No Chance
Publication Year
2002
Subject
General, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics
Series
Mathematical Sciences Research Institute Publications
Format
Hardcover
Dimensions
Item Height
1.3 in
Item Weight
33.2 Oz
Item Length
9.6 in
Item Width
6.4 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2002-034798
Dewey Edition
21
Reviews
"Combinatorial games provide the teacher with a creative means to allow students to explore mathematical ideas and develop problem-solving skills. While the rules are simple, there are rich mathematical theories underlying these games. Students are puzzled at first, and seem to make random moves. By encouraging them to start with simple games with a small number of pieces and then gradually increase the complexity, students are able to formulate and test their own theories for strategic solutions." S. Wali Abdi, School Science and Mathematics, "Combinatorial games provide the teacher with a creative means to allow students to explore mathematical ideas and develop problem-solving skills. While the rules are simple, there are rich mathematical theories underlying these games. Students are puzzled at first, and seem to make random moves. By encouraging them to start with simple games with a small number of pieces and then gradually increase the complexity, students are able to formulate and test their own theories for strategic solutions." <br/<S. Wali Abdi, School Science and Mathematics
Series Volume Number
Series Number 42
Illustrated
Yes
Dewey Decimal
519.3
Table Of Content
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.
Synopsis
This fascinating 2003 collection of articles runs the gamut from new theoretical approaches, both computational and mathematical, to other games such as Amazons, Chomp, Dot-and-Boxes, Go, Chess, and Hex. Includes an updated bibliography by A. Fraenkel and a list of combinatorial game theory problems by R. K. Guy., This book is a state-of-the-art look at combinatorial games, that is, games not involving chance or hidden information. It contains a fascinating collection of articles by some of the top 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 new theoretical approaches (infinite games, generalizations of game values, 2-player cellular automata, Alpha-Beta pruning under partial orders) to the very latest in some of the hottest 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 an updated bibliography by A. Fraenkel and an updated and annotated list of combinatorial game theory problems by R. K. Guy., 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.
LC Classification Number
QA269 .M63 2002
Item description from the seller
Seller feedback (2,612)
- c***c (251)- Feedback left by buyer.Past 6 monthsVerified purchaseWell priced for what it’s going for in the resale market. Great communication. Careful packaging. Quick ship. Brand new as described.
- s***e (91)- Feedback left by buyer.Past 6 monthsVerified purchaseCD's are in very good condition as described, were sent in a box and very well packed. Very fair shipping price. a great seller! Thanks!!
- b***b (4209)- Feedback left by buyer.Past monthVerified purchaseVery quick shipping, great value and better than was expected, well packaged and exactly what was described