


























We prove that chess played on the infinite chessboard $\mathbb{Z}^2$ with infinitely many pieces is as powerful as it could possibly be, by showing that every open Gale-Stewart game with draws is strategically equivalent to some infinite chess position and vice versa. As our construction is computable and open Gale-Stewart games are well understood, this allows us to resolve many open questions about the complexity of infinite chess with infinitely many pieces. In particular, all countable ordinals arise as the game value of some such chess position. We also give an alternate construction that realizes all countable ordinals as game values, with the pleasing property that it consists only of the king pair and pawns.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。