The switch operators and push-the-button games: a sequential compound over rulesets
From MaRDI portal
Publication:683756
DOI10.1016/J.TCS.2018.01.003zbMATH Open1390.91077arXiv1707.07966OpenAlexW2963703792MaRDI QIDQ683756FDOQ683756
Authors: E. Duchêne, Marc Heinrich, Urban Larsson, Aline Parreau
Publication date: 9 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: We study operators that combine combinatorial games. This field was initiated by Sprague-Grundy (1930s), Milnor (1950s) and Berlekamp-Conway-Guy (1970-80s) via the now classical disjunctive sum operator on (abstract) games. The new class consists in operators for rulesets, dubbed the switch-operators. The ordered pair of rulesets (R 1 , R 2) is compatible if, given any position in R 1 , there is a description of how to move in R 2. Given compatible (R 1 , R 2), we build the push-the-button game R 1 R 2 , where players start by playing according to the rules R 1 , but at some point during play, one of the players must switch the rules to R 2 , by pushing the button ". Thus, the game ends according to the terminal condition of ruleset R 2. We study the pairwise combinations of the classical rulesets Nim, Wythoff and Euclid. In addition, we prove that standard periodicity results for Subtraction games transfer to this setting, and we give partial results for a variation of Domineering, where R 1 is the game where the players put the domino tiles horizontally and R 2 the game where they play vertically (thus generalizing the octal game 0.07).
Full work available at URL: https://arxiv.org/abs/1707.07966
Recommendations
Cites Work
- Winning ways for your mathematical plays. Vol. 1.
- Combinatorial game theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- The Raleigh game
- Periodicity and other structure in a colorful family of Nim-like arrays
- Combinatorial games with a pass: a dynamical systems approach
- Invariant games
- A Game Based on the Euclidean Algorithm and A Winning Strategy for it
- On the misere version of game Euclid and miserable games
- How long can one bluff in the domination game?
- Building Nim
- Sequential compounds of combinatorial games
- The game of 3-Euclid
- Variations of the game 3-Euclid
- Conjoined games: \textsc{go-cut} and \textsc{sno-go}
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The switch operators and push-the-button games: a sequential compound over rulesets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683756)