Construction of ASEAN Chess Endgame Tablebases: A Computational Analysis of King-Knight-Queen and King-Bishop-Queen Patterns Against a Lone King

Abstract

Background and Objectives: ASEAN Chess, is a traditional strategic board game that differs substantially from International Chess in terms of piece movement, endgame dynamics, and regulatory constraints. One of its most distinctive features is the official piece-counting rule, which limits the number of moves allowed to force a checkmate when one side is reduced to a lone King. This rule has a significant impact on endgame outcomes, often determining whether a theoretically winning position results in a practical draw. Despite its widespread practice at both national and international competitive levels, ASEAN Chess remains significantly underexplored from computational and game-theoretic perspectives, particularly with respect to complex endgame scenarios involving multiple attacking pieces. Existing studies and practical knowledge rely heavily on human intuition and empirical experience, which are insufficient to fully capture the exhaustive state space of such endgames. The objective of this research is to develop Endgame Tablebases (EGTBs) for ASEAN Chess and to conduct a comprehensive computational analysis of two complex endgame configurations: King-Knight-Queen versus King (K-N-Q vs. K) and King-Bishop-Queen versus King (K-B-Q vs. K). The study aims to determine, under optimal play, the exact distribution of forced wins and draws, to identify the maximum Distance to Mate (DTM), and to evaluate the practical impact of the official piece-counting rules on theoretical endgame outcomes.

Methodology: This research employs a computational framework based on retrograde analysis to exhaustively evaluate all legal endgame positions for the selected configurations. The process begins by generating all legally reachable board states in accordance with the official rules of ASEAN Chess. To manage the large state space, symmetry-based reduction techniques are applied, allowing equivalent board positions to be grouped and analyzed efficiently. Terminal checkmate positions are initialized as Distance to Mate (DTM) zero. The algorithm then iteratively propagates results backward through the game tree, assigning game-theoretic values to each position by considering all possible legal moves for both the attacking and defending sides. Positions are classified as forced wins, draws, or losses under the assumption of perfect play, with the attacking side always moving first. The resulting EGTBs record not only the outcome of each position but also the maximum number of moves required to force a checkmate. In addition, the official ASEAN Chess piece-counting rules are incorporated into the analysis, with particular attention given to the regulation limiting the Bishop’s pursuit to a maximum of 44 moves. This allows a direct comparison between theoretical outcomes and regulation-constrained practical results.

Main Results: The computational analysis reveals that the K-N-Q configuration comprises a total of 11,930,016 legal positions. Of these, only 472,900 positions (3.96%) result in forced wins for the attacking side, while the remaining 96.04% are theoretical draws, indicating strong defensive resilience against a lone King. The deepest winning positions in this configuration require up to 36 moves to achieve checkmate. In contrast, the K-B-Q configuration encompasses 12,170,304 legal positions.       Among these, 10,438,976 positions (85.77%) are identified as forced wins, while 14.23% result in draws. The maximum Distance to Mate in this configuration reaches 57 moves, demonstrating that although the position is highly favorable for the attacker, precise and extended maneuvering is often required. When the official 44-move piece-counting rule for the Bishop is applied, 278,040 theoretically winning positions exceed the permitted move limit. As a result, the effective winning probability is reduced to 85.39%, with these positions converted into practical draws due solely to regulatory constraints.

Conclusions: This study provides the first exhaustive Endgame Tablebases for complex ASEAN Chess endgames involving Knight-Queen and Bishop-Queen configurations.    The results confirm a substantial disparity in piece potency, with the Bishop-Queen combination exhibiting significantly greater offensive effectiveness than the Knight-Queen combination. Furthermore, the findings demonstrate that official counting rules play a decisive role in shaping practical outcomes, creating a measurable divergence between theoretical optimal play and regulation-constrained competition.

Practical Application: The developed EGTBs establish a rigorous foundation for multiple practical applications. They can be integrated into high-performance      ASEAN Chess engines to improve endgame accuracy, utilized as authoritative references for training and instructional systems, and incorporated into digital or mobile learning platforms to enhance players’ understanding of optimal endgame play and counting rules. Additionally, the results provide valuable insights for tournament organizers    and rule designers by quantifying the practical effects of regulatory constraints. More broadly, this research contributes to computational game analysis and supports future studies of more complex ASEAN Chess endgames involving additional pieces.