Space-state complexity of Korean chess and Chinese chess

TL;DR

This paper calculates the exact space-state complexities of Korean chess and Chinese chess, providing precise measures of the number of reachable legal positions from the initial setup.

Contribution

It presents the first known exact calculations of space-state complexities for Korean chess and Chinese chess, filling a gap in game complexity data.

Findings

Exact space-state complexity of Korean chess determined

Exact space-state complexity of Chinese chess determined

Provides foundational data for future game analysis

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.