[图书][B] Winning ways for your mathematical plays, volume 4

ER Berlekamp, JH Conway, RK Guy - 2004 - taylorfrancis.com
In the quarter of a century since three mathematicians and game theorists collaborated to
create Winning Ways for Your Mathematical Plays, the book has become the definitive work …

[图书][B] Euler's gem: the polyhedron formula and the birth of topology

DS Richeson - 2012 - books.google.com
Leonhard Euler's polyhedron formula describes the structure of many objects--from soccer
balls and gemstones to Buckminster Fuller's buildings and giant all-carbon molecules. Yet …

Lossless abstraction of imperfect information games

A Gilpin, T Sandholm - Journal of the ACM (JACM), 2007 - dl.acm.org
Finding an equilibrium of an extensive form game of imperfect information is a fundamental
problem in computational game theory, but current techniques do not scale to large games …

Combinatorial games: selected bibliography with a succinct gourmet introduction

A Fraenkel - The Electronic Journal of Combinatorics, 2012 - combinatorics.org
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …

[图书][B] Adversarial reasoning: computational approaches to reading the opponent's mind

A Kott, WM McEneaney - 2006 - taylorfrancis.com
The rising tide of threats, from financial cybercrime to asymmetric military conflicts, demands
greater sophistication in tools and techniques of law enforcement, commercial and domestic …

[图书][B] Genius at play: the curious mind of John Horton Conway

S Roberts - 2024 - books.google.com
A multifaceted biography of a brilliant mathematician and iconoclast A mathematician unlike
any other, John Horton Conway (1937–2020) possessed a rock star's charisma, a …

Intelligent Heuristics Are the Future of Computing

SH Teng - ACM Transactions on Intelligent Systems and …, 2023 - dl.acm.org
Back in 1988, the partial game trees explored by computer chess programs were among the
largest search structures in real-world computing. Because the game tree is too large to be …

Finding equilibria in large sequential games of imperfect information

A Gilpin, T Sandholm - Proceedings of the 7th ACM conference on …, 2006 - dl.acm.org
Finding an equilibrium of an extensive form game of imperfect information is a fundamental
problem in computational game theory, but current techniques do not scale to large games …

[图书][B] Algorithms for abstracting and solving imperfect information games

A Gilpin - 2009 - search.proquest.com
Game theory is the mathematical study of rational behavior in strategic environments. In
many settings, most notably two-person zero-sum games, game theory provides particularly …

[PDF][PDF] Game-tree search with combinatorially large belief states

A Parker, D Nau, VS Subrahmanian - IJCAI, 2005 - cs.umd.edu
In games such as kriegspiel chess (a chess variant where players have no direct knowledge
of the opponent's pieces' locations) the belief state's sizes dwarf those of other partial …