More Games of No Chance
Herausgeber: Nowakowski, Richard
More Games of No Chance
Herausgeber: Nowakowski, Richard
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This 2003 book documents mathematical and computational advances in Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex, and more.
Andere Kunden interessierten sich auch für
- Games of No Chance 474,99 €
- J. Nowakowski (ed.)Games of No Chance72,99 €
- Games of No Chance 3168,99 €
- Richard J. Nowakowski (ed.)More Games of No Chance77,99 €
- Jerzy ZabczykChance and Decision. Stochastic Control in Discrete Time33,99 €
- AnonymousModellierungsaufgaben. Eine Chance für einen sprachsensiblen Mathematikunterricht?15,95 €
- József BeckCombinatorial Games98,99 €
-
-
-
This 2003 book documents mathematical and computational advances in Amazons, Chomp, Dot-and-Boxes, Go, Chess, Hex, and more.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 548
- Erscheinungstermin: 6. Dezember 2010
- Englisch
- Abmessung: 234mm x 156mm x 29mm
- Gewicht: 822g
- ISBN-13: 9780521155632
- ISBN-10: 0521155630
- Artikelnr.: 31793906
- Verlag: Cambridge University Press
- Seitenzahl: 548
- Erscheinungstermin: 6. Dezember 2010
- Englisch
- Abmessung: 234mm x 156mm x 29mm
- Gewicht: 822g
- ISBN-13: 9780521155632
- ISBN-10: 0521155630
- Artikelnr.: 31793906
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.
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.
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.
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.