AI Chat AI Image Generator AI Video Text to Speech

A Note on Computational Complexity of Dou Shou Qi

04/27/2019

∙

by Zhujun Zhang, et al.

∙

∙

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.

research

∙ 03/30/2019

A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi

We review NP-hardness framework and PSPACE-hardness framework for a type...

0 Zhujun Zhang, et al. ∙

research

∙ 11/26/2019

A Note on Computational Complexity of Kill-all Go

Kill-all Go is a variant of Go in which Black tries to capture all white...

0 Zhujun Zhang, et al. ∙

research

∙ 01/31/2022

Computational Complexity of Segmentation

Computational feasibility is a widespread concern that guides the framin...

11 Federico Adolfi, et al. ∙

research

∙ 12/19/2018

The Computational Complexity of Angry Birds

The physics-based simulation game Angry Birds has been heavily researche...

0 Matthew Stephenson, et al. ∙

research

∙ 06/19/2022

The Game of Tumbleweed is PSPACE-complete

Tumbleweed is a popular two-player perfect-information new territorial g...

0 Lear Bahack, et al. ∙

research

∙ 12/06/2021

On the complexity of Dark Chinese Chess

This paper provides a complexity analysis for the game of dark Chinese c...

0 Cong Wang, et al. ∙

research

∙ 07/19/2022

All Paths Lead to Rome

All roads lead to Rome is the core idea of the puzzle game Roma. It is p...

0 Kevin Goergen, et al. ∙