Guaranteed scoring games

zbMATH Open1410.91127arXiv1505.07905MaRDI QIDQ311536FDOQ311536

Authors: Urban Larsson, R. J. Nowakowski, Carlos Santos, João Pedro Neto 

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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).

Full work available at URL: https://arxiv.org/abs/1505.07905

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Games with guaranteed scores and waiting moves
• Scoring play combinatorial games
• Scoring games: the state of play
• The combinatorial game theory of well-tempered scoring games
• Game comparison through play

zbMATH Keywords

combinatorial game theoryconstructive game comparisondisjunctive sumgame reductionnormal playquotient monoidscoring game

Mathematics Subject Classification ID

2-person games (91A05) Ordered semigroups and monoids (06F05) Combinatorial games (91A46)

Cites Work

• Winning ways for your mathematical plays. Vol. 1.
• Title not available (Why is that?)
• Lattices and ordered algebraic structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A metric for positional games
• Misère quotients for impartial games
• The combinatorial game theory of well-tempered scoring games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mean play of sums of positional games

Cited In (11)

• Golden games
• The largest connected subgraph game
• Game comparison through play
• The orthogonal colouring game
• The largest connected subgraph game
• The complexity of two colouring games
• \textsc{influence}: a partizan scoring game on graphs
• Games with guaranteed scores and waiting moves
• Discrete Richman-bidding scoring games
• Two-player tower of Hanoi
• 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)