# A Note on Computational Complexity of Dou Shou Qi

## TL;DR

This paper proves that Dou Shou Qi, a Chinese strategy game, is EXPTIME-complete by constructing all necessary gadgets within an EXPTIME-hardness framework, establishing its computational complexity.

## Contribution

It is the first to rigorously analyze and prove Dou Shou Qi's computational complexity as EXPTIME-complete.

## Key findings

- Dou Shou Qi is EXPTIME-complete.
- Constructed all gadgets for the hardness framework.
- Established the game's computational difficulty.

## 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.