Book Description
Surveys the state-of-the-art in combinatorial game theory, that is games not involving chance or hidden information.
Author : Urban Larsson
Publisher : Cambridge University Press
Page : 499 pages
File Size : 13,13 MB
Release : 2019-05-09
Category : Computers
ISBN : 1108485804
Surveys the state-of-the-art in combinatorial game theory, that is games not involving chance or hidden information.
Author : Richard J. Nowakowski
Publisher : Cambridge University Press
Page : 556 pages
File Size : 38,45 MB
Release : 1998-11-13
Category : Mathematics
ISBN : 9780521646529
Is Nine-Men Morris, in the hands of perfect players, a win for white or for black - or a draw? Can king, rook, and knight always defeat king and two knights in chess? What can Go players learn from economists? What are nimbers, tinies, switches and minies? This book deals with combinatorial games, that is, games not involving chance or hidden information. Their study is at once old and young: though some games, such as chess, have been analyzed for centuries, the first full analysis of a nontrivial combinatorial game (Nim) only appeared in 1902. The first part of this book will be accessible to anyone, regardless of background: it contains introductory expositions, reports of unusual tournaments, and a fascinating article by John H. Conway on the possibly everlasting contest between an angel and a devil. For those who want to delve more deeply, the book also contains combinatorial studies of chess and Go; reports on computer advances such as the solution of Nine-Men Morris and Pentominoes; and theoretical approaches to such problems as games with many players. If you have read and enjoyed Martin Gardner, or if you like to learn and analyze new games, this book is for you.
Author : Michael H. Albert
Publisher : Cambridge University Press
Page : 577 pages
File Size : 39,9 MB
Release : 2009-05-29
Category : Mathematics
ISBN : 0521861349
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.
Author : Richard J. Nowakowski
Publisher : Cambridge University Press
Page : 351 pages
File Size : 32,98 MB
Release : 2015-04-16
Category : Mathematics
ISBN : 1107011035
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.
Author : Richard Nowakowski
Publisher : Cambridge University Press
Page : 552 pages
File Size : 12,88 MB
Release : 2002-11-25
Category : Mathematics
ISBN : 9780521808323
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.
Author : Richard J. Nowakowski
Publisher : Walter de Gruyter GmbH & Co KG
Page : 530 pages
File Size : 38,18 MB
Release : 2022-08-22
Category : Mathematics
ISBN : 3110755491
Elwyn Berlekamp, John Conway, and Richard Guy wrote ‘Winning Ways for your Mathematical Plays’ and turned a recreational mathematics topic into a full mathematical fi eld. They combined set theory, combinatorics, codes, algorithms, and a smattering of other fi elds, leavened with a liberal dose of humor and wit. Their legacy is a lively fi eld of study that still produces many surprises. Despite being experts in other areas of mathematics, in the 50 years since its publication, they also mentored, talked, and played games, giving their time, expertise, and guidance to several generations of mathematicians. This volume is dedicated to Elwyn Berlekamp, John Conway, and Richard Guy. It includes 20 contributions from colleagues that refl ect on their work in combinatorial game theory.
Author : Bruce Landman
Publisher : Walter de Gruyter GmbH & Co KG
Page : 1187 pages
File Size : 48,59 MB
Release : 2014-08-22
Category : Mathematics
ISBN : 311036932X
"Integers" is a refereed online journal devoted to research in the area of combinatorial number theory. It publishes original research articles in combinatorics and number theory. Topics covered by the journal include additive number theory, multiplicative number theory, sequences and sets, extremal combinatorics, Ramsey theory, elementary number theory, classical combinatorial problems, hypergraphs, and probabilistic number theory. Integers also houses a combinatorial games section. This work presents all papers of the 2013 volume in book form.
Author : David A. Blackwell
Publisher : Courier Corporation
Page : 388 pages
File Size : 27,94 MB
Release : 2012-06-14
Category : Mathematics
ISBN : 0486150895
Evaluating statistical procedures through decision and game theory, as first proposed by Neyman and Pearson and extended by Wald, is the goal of this problem-oriented text in mathematical statistics. First-year graduate students in statistics and other students with a background in statistical theory and advanced calculus will find a rigorous, thorough presentation of statistical decision theory treated as a special case of game theory. The work of Borel, von Neumann, and Morgenstern in game theory, of prime importance to decision theory, is covered in its relevant aspects: reduction of games to normal forms, the minimax theorem, and the utility theorem. With this introduction, Blackwell and Professor Girshick look at: Values and Optimal Strategies in Games; General Structure of Statistical Games; Utility and Principles of Choice; Classes of Optimal Strategies; Fixed Sample-Size Games with Finite Ω and with Finite A; Sufficient Statistics and the Invariance Principle; Sequential Games; Bayes and Minimax Sequential Procedures; Estimation; and Comparison of Experiments. A few topics not directly applicable to statistics, such as perfect information theory, are also discussed. Prerequisites for full understanding of the procedures in this book include knowledge of elementary analysis, and some familiarity with matrices, determinants, and linear dependence. For purposes of formal development, only discrete distributions are used, though continuous distributions are employed as illustrations. The number and variety of problems presented will be welcomed by all students, computer experts, and others using statistics and game theory. This comprehensive and sophisticated introduction remains one of the strongest and most useful approaches to a field which today touches areas as diverse as gambling and particle physics.
Author : Andrew J. Blumberg
Publisher : Cambridge University Press
Page : 441 pages
File Size : 47,18 MB
Release : 2022-07-21
Category : Mathematics
ISBN : 1009123297
A graduate-level introduction to the homotopical technology in use at the forefront of modern algebraic topology.
Author : Albert Fathi
Publisher : Cambridge University Press
Page : 377 pages
File Size : 39,95 MB
Release : 2024-05-31
Category : Mathematics
ISBN : 1009320718
A selection of results, spanning a broad spectrum of disciplines, from the MSRI program on Hamiltonian Systems during Fall 2018.