default search action

combined dblp search
author search
venue search
publication search

ask others

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

Dan Brumleve, Joel David Hamkins, Philipp Schlicht (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-30870-3_9

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cie/BrumleveHS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cie/BrumleveHS12
Dan Brumleve, Joel David Hamkins, Philipp Schlicht:
The Mate-in-n Problem of Infinite Chess Is Decidable. CiE 2012: 78-88

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.