The Mate-in-n Problem of Infinite Chess Is Decidable

DOI10.1007/978-3-642-30870-3_9zbMath1357.03042DBLPconf/cie/BrumleveHS12arXiv1201.5597OpenAlexW1893952159WikidataQ56813209 ScholiaQ56813209MaRDI QIDQ2904396

Philipp Schlicht, Joel David Hamkins, Dan Brumleve

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5597

Mathematics Subject Classification ID

2-person games (91A05) Decidability of theories and sets of sentences (03B25)

Related Items (2)

Transfinite game values in infinite draughts ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

This page was built for publication: The Mate-in-n Problem of Infinite Chess Is Decidable