Combinatorial Games: Selected Bibliography with a Succinct Gourmet Introduction
Open Access
- 9 August 2012
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 1000, DS2: Aug 9-2012
Abstract
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 dice) and outcome restricted to (lose, win), (tie, tie) and (draw, draw) for the two players who move alternately. Tie is an end position such as in tic-tac-toe, where no player wins, whereas draw is a dynamic tie: any position from which a player has a nonlosing move, but cannot force a win. Both the easy game of Nim and the seemingly difficult chess are examples of combinatorial games. And so is go. The shorter terminology game, games is used below to designate combinatorial games.Keywords
This publication has 759 references indexed in Scilit:
- Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular n‐queens solutionsJournal of Combinatorial Designs, 2007
- Collective stochastic versions of playable games as metaphors for complex biosystems: Team connect fourComplexity, 2003
- Edge‐partitions of planar graphs and their game coloring numbersJournal of Graph Theory, 2002
- Game chromatic index ofk-degenerate graphsJournal of Graph Theory, 2001
- Game chromatic number of outerplanar graphsJournal of Graph Theory, 1999
- On claw-freeM-oriented critical kernel-imperfect digraphsJournal of Graph Theory, 1996
- A survey of the search theory literatureNaval Research Logistics (NRL), 1991
- An infiltration game onk arcsNaval Research Logistics (NRL), 1991
- A one-dimensional helicopter-submarine gameNaval Research Logistics (NRL), 1989
- A one-dimensional infiltration gameNaval Research Logistics (NRL), 1988