Guaranteed scoring games

zbMath1410.91127arXiv1505.07905MaRDI QIDQ311536

Richard J. Nowakowski, Carlos P. Santos, Urban Larsson, João Pedro Neto

Publication date: 13 September 2016

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

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

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)

Related Items (10)

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

Cites Work

• Mean play of sums of positional games
• Lattices and ordered algebraic structures
• A metric for positional games
• Misère quotients for impartial games
• The combinatorial game theory of well-tempered scoring games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guaranteed scoring games