Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
We study the dynamics of the so-called Game of Cards by using tools developed in the context of discrete dynamical systems. We extend a result of [4] and [10] (the last one in the ...
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...
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...
Erik D. Demaine, Martin L. Demaine, David Eppstein