论文标题
关于自友和反射象棋问题的计算复杂性的注释
A Note on the Computational Complexity of Selfmate and Reflexmate Chess Problems
论文作者
论文摘要
自友是一个国际象棋问题，其中白色首先需要迫使黑色在指定数量的移动中检查。反射素是自相手的衍生物，其中白色迫使黑色迫使黑色检查以下条件：如果任何一个玩家都能检查，则必须这样做（当这种情况仅适用于黑色时，它是半反复的mate）。我们稍微修改了国际象棋的降低，并将其减少到这些国际象棋问题上。事实证明，自友，反射和半回形的人都是指定时间完成的。
A selfmate is a Chess problem in which White, moving first, needs to force Black to checkmate within a specified number of moves. The reflexmate is a derivative of the selfmate in which White compels Black to checkmate with the added condition that if either player can checkmate, they must do that (when this condition applies only to Black, it is a semi-reflexmate). We slightly modify the reduction of EXPTIME-hardness of Chess and apply the reduction to these Chess problems. It is proved that selfmate, reflexmate, and semi-reflexmate are all EXPTIME-complete.
