Guaranteed scoring games
From MaRDI portal
Abstract: The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include, as subclasses, the scoring games considered by Milnor (1953), Ettinger (1996) and Johnson (2014). We present the structure of GS and the techniques needed to analyze a sum of guaranteed games. Firstly, GS form a partially ordered monoid, via defined Right- and Left-stops over the reals, and with disjunctive sum as the operation. In fact, the structure is a quotient monoid with partially ordered congruence classes. We show that there are four reductions that when applied, in any order, give a unique representative for each congruence class. The monoid is not a group, but in this paper we prove that if a game has an inverse it is obtained by `switching the players'. The order relation between two games is defined by comparing their stops in extit{any} disjunctive sum. Here, we demonstrate how to compare the games via a finite algorithm instead, extending ideas of Ettinger, and also Siegel (2013).
Recommendations
Cites work
- scientific article; zbMATH DE number 3946195 (Why is no real title available?)
- scientific article; zbMATH DE number 1568491 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- scientific article; zbMATH DE number 3020856 (Why is no real title available?)
- scientific article; zbMATH DE number 3078996 (Why is no real title available?)
- A metric for positional games
- Lattices and ordered algebraic structures
- Mean play of sums of positional games
- Misère canonical forms of partizan games
- Misère quotients for impartial games
- The combinatorial game theory of well-tempered scoring games
- Winning ways for your mathematical plays. Vol. 1.
Cited in
(13)- The largest connected subgraph game
- Golden games
- \textsc{influence}: a partizan scoring game on graphs
- The complexity of two colouring games
- Scoring play combinatorial games
- The largest connected subgraph game
- Game comparison through play
- Discrete Richman-bidding scoring games
- The orthogonal colouring game
- Scoring games: the state of play
- Two-player tower of Hanoi
- Games with guaranteed scores and waiting moves
- The combinatorial game theory of well-tempered scoring games
This page was built for publication: Guaranteed scoring games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q311536)