Combinatorial games with a pass: A dynamical systems approach

From MaRDI portal
Publication:5264587

DOI10.1063/1.3650234zbMATH Open1317.91008arXiv1204.3222OpenAlexW2067289178WikidataQ51455794 ScholiaQ51455794MaRDI QIDQ5264587FDOQ5264587

Adam Scott Landsberg, Eric J. Friedman, Rebecca E. Morrison

Publication date: 27 July 2015

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Abstract: By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior. We consider two well known combinatorial games, 3-pile Nim and 3-row Chomp. In the case of Nim, we observe that the introduction of the pass dramatically alters the game's underlying structure, rendering it considerably more complex, while for Chomp, the pass move is found to have relatively minimal impact. We show how these results can be understood by recasting these games as dynamical systems describable by dynamical recursion relations. From these recursion relations we are able to identify underlying structural connections between these "games with passes" and a recently introduced class of "generic (perturbed) games." This connection, together with a (non-rigorous) numerical stability analysis, allows one to understand and predict the effect of a pass on a game.


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





Cites Work


Cited In (5)






This page was built for publication: Combinatorial games with a pass: A dynamical systems approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264587)