# 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. D. 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… CONTINUE READING

#### Supplemental Presentations

#### Paper Mentions

BLOG POST

6 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-8 OF 8 REFERENCES

Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n

- Mathematics, Computer Science
- 1981

76

Achim Blumensath and Erich Grädel . Automatic structures

- 2000

Three lectures on automatic structures

- 2007