The combinatorial game theory of well-tempered scoring games
From MaRDI portal
Publication:2453496
DOI10.1007/S00182-013-0386-6zbMATH Open1294.91040arXiv1112.3610OpenAlexW2041147693MaRDI QIDQ2453496FDOQ2453496
Authors: Will Johnson
Publication date: 6 June 2014
Published in: International Journal of Game Theory (Search for Journal in Brave)
Abstract: We consider the class of "well-tempered" integer-valued scoring games, which have the property that the parity of the length of the game is independent of the line of play. We consider disjunctive sums of these games, and develop a theory for them analogous to the standard theory of disjunctive sums of normal-play partizan games. We show that the monoid of well-tempered scoring games modulo indistinguishability is cancellative but not a group, and we describe its structure in terms of the group of normal-play partizan games. We also classify Boolean-valued well-tempered scoring games, showing that there are exactly seventy, up to equivalence.
Full work available at URL: https://arxiv.org/abs/1112.3610
Recommendations
- Games with guaranteed scores and waiting moves
- Scoring games: the state of play
- The linking-unlinking game
- Guaranteed scoring games
- Scoring play combinatorial games
- scientific article
- Games of no chance 5. Papers of the BIRS workshop on combinatorial game theory, Banff, Canada, January 2011
- Playing with Knots
- Some new combinatorial games
- \(N\)-player partizan games
Cites Work
Cited In (8)
This page was built for publication: The combinatorial game theory of well-tempered scoring games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453496)