Problem
Research questions and friction points this paper is trying to address.
Partizan Arc Kayles
PSPACE-complete
Positive CNF
It's Hard to PArcK
🤖 AI Summary
研究证明了Partizan Arc Kayles游戏是PSPACE完全问题，通过从正CNF归约并使用新发现的技术创建高温度的游戏位置。
📝 Abstract
We show that Partizan Arc Kayles (PArcK), a generalization of Domineering to graphs, is PSPACE-complete via a reduction from Positive CNF and with recently-discovered techniques for creating PArcK positions with high temperature. The reduction uses only red and blue edges.
Innovation
Methods, ideas, or system contributions that make the work stand out.
PSPACE-complete
Partizan Arc Kayles
Positive CNF
high temperature
🔎 Similar Papers
2024-04-23arXiv.orgCitations: 2
