On the Complexity of n-player Toppling Dominoes

被引:0
|
作者
Cincotti, Alessandro [1 ]
机构
[1] Japan Adv Inst Sci & Technol, Sch Informat Sci, Nomi, Ishikawa 9231292, Japan
关键词
Combinatorial games; Toppling Dominoes; n-player games; PSPAC epsilon-complete;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 PSPAC epsilon-complete.
引用
收藏
页码:461 / 464
页数:4
相关论文
共 50 条