Shogi State-Space Complexity Estimated

A new paper on arXiv presents a high-precision statistical estimation of the number of reachable positions in Shogi, a Japanese board game. The researchers used Monte Carlo sampling to address the challenge of distinguishing legally reachable positions from the initial position among the vast number of valid board configurations.

The study's approach combines Monte Carlo sampling with a novel method to provide a more accurate estimate of the state-space complexity. Previous combinatorial estimates had a large gap of five orders of magnitude, ranging from $10^{64}$ to $10^{69}$.

The researchers' findings have implications for the development of more efficient Shogi-playing algorithms and a deeper understanding of the game's complexity. The study's results may also be applicable to other complex games and domains, and the research community is likely to scrutinize the methodology and findings to determine their validity and potential applications.