The Computational Complexity of Forced Capture Hnefatafl

Theoretical Computer Science（2024）

引用 0|浏览0

暂无评分

摘要

We define a new asymmetric partizan loopy combinatorial game, Forced-Capture Hnefatafl, similar to Hnefatafl, except that players are forced to make capturing moves when available. We show that this game is PSPACE-hard using a reduction from Positive-CNF, making progress towards classifying the computational complexity of proper Hnefatafl.

查看译文

关键词

combinatorial games,PSPACE,computational complexity,Hnefatafl

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要