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 J. Hamkins and Philipp Schlicht},
  journal={ArXiv},
  year={2012},
  volume={abs/1201.5597}
}
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… Expand
6 Citations

Paper Mentions

Transfinite Game Values in Infinite Chess
  • 6
  • PDF
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
  • 10
  • PDF
A Position in Infinite Chess With Game Value ω4
  • PDF
UNDECIDABLE PROBLEMS: A SAMPLER
  • 24
  • PDF
CLASSIFICATION OF RESEARCH
  • PDF

References

SHOWING 1-8 OF 8 REFERENCES
Transfinite Game Values in Infinite Chess
  • 6
  • PDF
Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n
  • 97
Automatic structures
  • Achim Blumensath, E. Grädel
  • Computer Science
  • Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
  • 2000
  • 319
  • PDF
Three lectures on automatic structures
  • Logic Colloquium
  • 2007
Achim Blumensath and Erich Grädel . Automatic structures
  • 15 th Annual IEEE Symposium on Logic in Computer Science
  • 2000
Automatic Presentations of Structures
  • 294