The mate-in-n problem of infinite chess is decidable

D. Brumleve, J. D. Hamkins, and P. Schlicht, “The mate-in-n problem of infinite chess is decidable,” , S. Cooper, A. Dawar, and B. Löwe, Ed., Springer Berlin Heidelberg, 2012, vol. 7318, pp. 78-88.

Journal Citation arχiv

@incollection{BrumleveHamkinsSchlicht:TheMateInNProblemOfInfiniteChessIsDecidable,
year={2012},
isbn={978-3-642-30869-7},
booktitle={How the World Computes},
volume={7318},
series={Lecture Notes in Computer Science},
editor={Cooper, S.Barry and Dawar, Anuj and Löwe, Benedikt},
doi={10.1007/978-3-642-30870-3_9},
title={The Mate-in-n Problem of Infinite Chess Is Decidable},
url={http://dx.doi.org/10.1007/978-3-642-30870-3_9},
publisher={Springer Berlin Heidelberg},
author={Brumleve, Dan and Hamkins, Joel David and Schlicht, Philipp},
pages={78-88},
eprint = {1201.5597},
}

Infinite chess is chess played on an infinite edgeless chessboard. The familiar chess pieces move about according to their usual chess rules, and each player strives to place the opposing king into checkmate. The mate-in-$n$ problem of infinite chess is the problem of determining whether a designated player can force a win from a given finite position in at most $n$ moves. A naive formulation of this problem leads to assertions of high arithmetic complexity with $2n$ alternating quantifiers—*there is a move for white, such that for every black reply, there is a countermove for white*, and so on. In such a formulation, the problem does not appear to be decidable; and one cannot expect to search an infinitely branching game tree even to finite depth.

Nevertheless, the main theorem of this article, confirming a conjecture of the first author and C. D. A. Evans, establishes that the mate-in-$n$ problem of infinite chess is computably decidable, uniformly in the position and in $n$. Furthermore, there is a computable strategy for optimal play from such mate-in-$n$ positions. The proof proceeds by showing that the mate-in-$n$ problem is expressible in what we call the first-order structure of chess, which we prove (in the relevant fragment) is an automatic structure, whose theory is therefore decidable. Unfortunately, this resolution of the mate-in-$n$ problem does not appear to settle the decidability of the more general winning-position problem, the problem of determining whether a designated player has a winning strategy from a given position, since a position may admit a winning strategy without any bound on the number of moves required. This issue is connected with transfinite game values in infinite chess, and the exact value of the omega one of chess $\omega_1^{\rm chess}$ is not known.

Richard Stanley’s question on mathoverflow: Decidability of chess on infinite board?

6 thoughts on “The mate-in-n problem of infinite chess is decidable”

Wow, I will love to check this out! This must be the first paper about chess by a set theorist.

Reply ↓

Joel David Hamkins on January 31, 2012 at 2:36 pm said:

Thanks, Sam. You might be interested to hear that we have another paper coming soon, by myself, Cory Evans (US chess master) and W. Hugh Woodin, in which we investigate $\omega_1^{chess}$. In particular, one of the theorems we have is that the in three-dimensional infinite chess, there are positions realizing any countable ordinal game value. So the $\omega_1^{\rm chess}$ of infinite positions in three-dimensional infinite chess is true $\omega_1$. Unfortunately, we can’t fit the positions into two dimensions, although of course we would like to do so.

Reply ↓