A Note on Computational Complexity of Dou Shou Qi
Computational Complexity
2019-05-01 v1
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.
Cite
@article{arxiv.1904.13205,
title = {A Note on Computational Complexity of Dou Shou Qi},
author = {Zhujun Zhang},
journal= {arXiv preprint arXiv:1904.13205},
year = {2019}
}
Comments
11 pages, 11 figures. arXiv admin note: text overlap with arXiv:1904.00200