A Note on Computational Complexity of Dou Shou Qi

04/27/2019

∙

by   Zhujun Zhang, et al.

∙

0

∙

share

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.