Space-state complexity of Korean chess and Chinese chess

2015/07/23 by Donghwi Park, Park, Donghwi
Economics, Econometrics and Finance · #Complex Systems and Time Series Analysis #FOS: Mathematics #General Mathematics (math.GM)

paper · pdf · doi:10.48550/arxiv.1507.06401

openalex publication_date 2015/07/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This article describes how to calculate exact space-state complexities of Korean chess and Chinese chess. The state-space complexity (a.k.a. search-space complexity) of a game is defined as the number of legal game positions reachable from the initial position of the game. The number of exact space-state complexities are not known for most of games. However, we calculated actual space-state complexities of Korean chess and Chinese chess.

Related

• On the complexity of Dark Chinese Chess
• A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi
• Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard
• A Note on Computational Complexity of Dou Shou Qi
• Emergent Complexity in the Decision-Making Process of Chess Players