# Dan Brumleve

- Citations Per Year

- Citations Per Year

- Full text PDF available (1)

Learn More

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… (More)

- ‹
- 1
- ›