Related papers: $x$ Plays Pokemon, for Almost-Every $x$
This paper considers a natural ruleset for playing a partisan combinatorial game on a directed graph, which we call Digraph Placement. Given a digraph $G$ with a not necessarily proper $2$-coloring of $V(G)$, the Digraph Placement game…
We define an all-small ruleset, Bipass, within the framework of normal-play combinatorial games. A game is played on finite strips of black and white stones. Stones of different colors are swapped provided they do not bypass one of their…
The two main results of this work are the following: if a space $X$ is such that player II has a winning strategy in the game $\gone(\Omega_x, \Omega_x)$ for every $x \in X$, then $X$ is productively countably tight. On the other hand, if a…
Reachability games are two-player games played on a graph, where the objective of $\texttt{REACH}$ player is to reach the target set whereas the objective of $\texttt{SAFE}$ player is to stay away from the target set. Reachability games…
We give a simple and short proof of the fact that the board game of Y cannot end in a draw. Our proof, based on the analogous result for the game of Hex (the so-called 'Hex Theorem'), is purely topological and does not depend on the shape…
We study a game in which one keeps flipping a coin until a given finite string of heads and tails occurs. We find the expected number of coin flips to end the game when the ending string consists of at most four maximal runs of heads or…
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect…
We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of semigroups. We characterize, which player has a…
An algorithm based on backward induction is devised in order to compute the optimal sequence of games to be played in Parrondo games. The algorithm can be used to find the optimal sequence for any finite number of turns or in the steady…
We consider dynamical systems $(X,T,\mu)$ which have exponential decay of correlations for either H\"older continuous functions or functions of bounded variation. Given a sequence of balls $(B_n)_{n=1}^\infty$, we give sufficient conditions…
Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games and their generalization to parity games with…
In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by…
We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary player, and two-player deterministic games by adding…
We present a simple model of Texas hold'em poker tournaments which retains the two main aspects of the game: i. the minimal bet grows exponentially with time; ii. players have a finite probability to bet all their money. The distribution of…
Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental universes} of combinatorial games; standard closure properties are…
The \emph{stationary set splitting game} is a game of perfect information of length $\omega_{1}$ between two players, \unspls and \spl, in which \unspls chooses stationarily many countable ordinals and \spls tries to continuously divide…
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph $G$ is called the cop number of $G$. The biggest open conjecture in this area…
We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins the game. In contrast, the similar problems of determining whether…
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph $G$ is called the cop number of $G$. The biggest open conjecture in this area…
We study two-player zero-sum games over infinite-state graphs with boundedness conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state…