Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CiE
/
Paper
The Mate-in-n Problem of Infinite Chess Is Decidable.
Dan Brumleve
,
Joel David Hamkins
,
Philipp Schlicht
Venue
C
CiE
Year
2012
Proceedings
CiE
DBLP record
conf/cie/BrumleveHS12 ↗
Browse the full
CiE paper archive
.