The strange algebra of combinatorial games
Combinatorics
2009-12-03 v1 Computer Science and Game Theory
Abstract
We present an algebraic framework for the analysis of combinatorial games. This framework embraces the classical theory of partizan games as well as a number of misere games, comply-constrain games, and card games that have been studied more recently. It focuses on the construction of the quotient monoid of a game, an idea that has been successively applied to several classes of games.
Cite
@article{arxiv.0912.0448,
title = {The strange algebra of combinatorial games},
author = {Johan Wästlund},
journal= {arXiv preprint arXiv:0912.0448},
year = {2009}
}
Comments
21 pages