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

@article{Brumleve2012TheMP,
title={The mate-in-n problem of infinite chess is decidable},
author={Dan Brumleve and Joel David Hamkins and Philipp Schlicht},
journal={ArXiv},
year={2012},
volume={abs/1201.5597}
}
• Published 26 January 2012
• Mathematics, Computer Science
• ArXiv
The mate-in-n problem of infinite chess--chess played on an infinite edgeless board--is the problem of determining whether a designated player can force a win from a given finite position in at most n moves. Although a straightforward formulation of this problem leads to assertions of high arithmetic complexity, with 2n alternating quantifiers, the main theorem of this article nevertheless confirms a conjecture of the second author and C. D. A. Evans by establishing that it is computably…
8 Citations

### Transfinite Game Values in Infinite Chess

• Mathematics, Computer Science
Integers
• 2014
It is proved that every countable ordinal arises as the game value of a position in infinite three-dimensional chess, and consequently the omega one of infiniteThree-dimensional Chess is as large as it can be, namely, true omega one.

### AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

• Computer Science
The Journal of Symbolic Logic
• 2019
This paper shows that the set of Turing machines that represent automata-presentable structures is ${\rm{\Sigma }}_1^1$-complete and uses similar methods to show that there is no reasonable characterisation of the structures with a polynomial-time presentation in the sense of Nerode and Remmel.

### A Note on the Computational Complexity of Selfmate and Reflexmate Chess Problems

A selfmate is a Chess problem in which White, moving ﬁrst, needs to force Black to checkmate within a speciﬁed number of moves. The reﬂexmate is a derivative of the selfmate in which White compels

### Infinite Hex is a draw

• Mathematics
• 2022
Every game-valued position in infinite Hex is intrinsically local, meaning that winning play depends only on a fixed finite region of the board, establishing the conclusion for all simple stone-placing games.

### A Position in Infinite Chess With Game Value ω4

• Mathematics
Integers
• 2017
We present a position in infinite chess exhibiting an ordinal game value of !4, thereby improving on the previously largest-known values of !3 and !3 · 4.

### UNDECIDABLE PROBLEMS: A SAMPLER

After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathemat- ics.

### CLASSIFICATION OF RESEARCH

• 2014
This is a summary account by topic of the research publications of J. D. Hamkins.

### CLASSIFICATION AND SUMMARY OF RESEARCH

This is a summary account by topic of the research publications of J. D. Hamkins.

## References

SHOWING 1-8 OF 8 REFERENCES

### Transfinite Game Values in Infinite Chess

• Mathematics, Computer Science
Integers
• 2014
It is proved that every countable ordinal arises as the game value of a position in infinite three-dimensional chess, and consequently the omega one of infiniteThree-dimensional Chess is as large as it can be, namely, true omega one.

### Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N

• Mathematics, Computer Science
ICALP
• 1981
It is proved that a natural generalization of chess to an n×n board is complete in exponential time. This implies that there exist chess-positions on an n×n chess-board for which the problem of

### Automatic structures

• Computer Science
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
• 2000
This work determines the complexity of model checking and query evaluation on automatic structures for fragments of first-order logic and gives model-theoretic characterisations for automatic structures via interpretations.

### Logic Colloquium 2007: Three lectures on automatic structures

• Computer Science
• 2008
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of

### Achim Blumensath and Erich Grädel . Automatic structures

• 15 th Annual IEEE Symposium on Logic in Computer Science
• 2000

### Three lectures on automatic structures

• Logic Colloquium
• 2007