On the Complexity of n-player Toppling Dominoes

Alessandro Cincotti · 2013

Abstract — Why are n-player games much more complex than two-player games? Is it much more difficult to cooperate or to compete? n-player Toppling Dominoes is an n-player version of Toppling Dominoes, a two-player combinatorial game. Because of queer games, i.e., games where no player has a winning strategy, cooperation is a key-factor in n-player games and, as a consequence, n-player Toppling Dominoes played on a set of rows of dominoes is PSPACE-complete.

Read the paper · More papers on PaperTik