CoToan：面向可复现游戏 AI 评测的可执行规则与表示契约

View PDF HTML (experimental)

Abstract:Game AI results are comparable only when different implementations expose the same decision problem. Yet seemingly minor representation choices can silently change that problem by altering action probabilities or collapsing states with different outcomes. We study this issue through CoToan, an executable specification and representation contract for Vietnamese Mathematical Chess connecting the Game Description Language (GDL) with OpenSpiel. The game provides a useful case because a single capture may have multiple arithmetic justifications, while outcomes can depend on scoring rules and a finite playing horizon. CoToan therefore represents actions by their state transitions rather than by arithmetic witnesses, and treats time and victory configuration as part of task identity. Cross-representation tests show agreement in legal actions, successor states, and terminal outcomes across hundreds of sampled and constructed positions, complemented by exhaustive checks of all 32 operator masks and 512 opposing-material subsets. Controlled diagnostics further show that uniform witness-level sampling alters endpoint-action probabilities, while omitting remaining time or victory settings can merge states with different terminal behavior. These results show that action semantics, time, and victory configuration are not merely implementation details. They are part of the experimental task itself and must be represented explicitly for reproducible game AI.

Comments:	Accepted at RIVF 2027
Subjects:	Artificial Intelligence (cs.AI)
Cite as:	arXiv:2610.39353 [cs.AI]
	(or arXiv:2610.39353v1 [cs.AI] for this version)
	https://doi.org/10.48550/arXiv.2610.39353 arXiv-issued DOI via DataCite

Submission history

From: Ha Thanh Nguyen [view email]
[v1] Thu, 29 Oct 2026 04:46:53 UTC (51 KB)