捕获-安静分解:国际象棋残局表基的验证定理
Capture-Quiet Decomposition: A Verification Theorem for Chess Endgame Tablebases
AI总结:
本文提出捕获-安静分解定理,用于验证国际象棋残局表基的WDL标签。该定理将每个合法位置分为终端、捕获或安静三类,并证明WDL标签正确当且仅当终端位置正确、捕获位置与更小棋子数的验证子模型一致、安静位置在同一残局中满足回溯一致性。
摘要:
我们提出了捕获-安静分解(CQD),一个用于验证国际象棋残局表基WDL标签的结构性定理。该定理将每个合法位置分解为恰好三种类别之一——终端、捕获或安静,并证明WDL标签正确当且仅当:(1)终端位置正确标记,(2)捕获位置与更小棋子数的验证子模型一致,(3)安静位置在相同残局中满足回溯一致性。关键见解是捕获位置将标签锚定到外部验证的子模型,打破允许平凡固定点(如全平局标签)仅通过自洽性满足的循环。我们对所有35个三子和四子残局(4200万位置)、所有110个五子残局和所有372个六子残局进行了彻底验证——总计517个残局,分解后的验证器在每种情况下都产生与完整回溯基线相同的违规计数。
英文摘要:
We present the Capture-Quiet Decomposition (CQD), a structural theorem for verifying Win-Draw-Loss (WDL) labelings of chess endgame tablebases. The theorem decomposes every legal position into exactly one of three categories -- terminal, capture, or quiet -- and shows that a WDL labeling is correct if and only if: (1) terminal positions are labeled correctly, (2) capture positions are consistent with verified sub-models of smaller piece count, and (3) quiet positions satisfy retrograde consistency within the same endgame. The key insight is that capture positions anchor the labeling to externally verified sub-models, breaking the circularity that allows trivial fixpoints (such as the all-draw labeling) to satisfy self-consistency alone. We validate CQD exhaustively on all 35 three- and four-piece endgames (42 million positions), all 110 five-piece endgames, and all 372 six-piece endgames -- 517 endgames in total -- with the decomposed verifier producing identical violation counts to a full retrograde baseline in every case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。