A Note on Computational Complexity of Dou Shou Qi
arXiv:1904.13205
Abstract
Dou Shou Qi is a Chinese strategy board game for two players. We use a EXPTIME-hardness framework to analyse computational complexity of the game. We construct all gadgets of the hardness framework. In conclusion, we prove that Dou Shou Qi is EXPTIME-complete.
11 pages, 11 figures. arXiv admin note: text overlap with arXiv:1904.00200