2 citations · 4 across the 7 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CC2019★ 2 cited
A Note on Computational Complexity of Kill-all Go
Zhujun Zhang
Kill-all Go is a variant of Go in which Black tries to capture all white stones, while White tries to survive. We consider computational complexity of Kill-all Go with two rulesets…
cs.CC2019
A Note on Computational Complexity of Dou Shou Qi
Zhujun Zhang
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 h…
cs.CC2019★ 2 cited
A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi
Zhujun Zhang
We review NP-hardness framework and PSPACE-hardness framework for a type of 2D platform games. We introduce a EXPTIME-hardness framework by defining some new gadgets. We use these…