Parameterized chess

被引：0
|
作者：
Scott, Allan [1 ]
Stege, Ulrike [1 ]
机构：
[1] Univ Victoria, Dept Comp Sci, Victoria, BC V8W 2Y2, Canada
来源：
PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS | 2008年 / 5018卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It has been suggested that the parameterized complexity class AW[*] is the natural home of k-move games, but to date the number of problems known to be in this class has remained small. We investigate the complexity of SHORT GENERALIZED CHESs-the problem of deciding whether a chess player can force checkmate in the next k moves. We show that this problem is complete for AW[*].
引用
收藏
页码：172 / 189
页数：18
相关论文
共 50 条
12345