Timeline for Decidability of the winning-position problem in an infinity chess with a finite number of short-range pieces only
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2014 at 18:37 | comment | added | Waldemar | I have tried to develop the argument from the last paragraph of your answer - see my answer. | |
| Mar 16, 2014 at 14:57 | comment | added | Joel David Hamkins | I rewrote my answer to eliminate the remarks about my previous misunderstanding of the question. | |
| Mar 16, 2014 at 14:56 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
Rewrote answer to correct my initial misunderstanding of the question
|
| Mar 16, 2014 at 14:34 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 535 characters in body
|
| Mar 16, 2014 at 14:26 | comment | added | Joel David Hamkins | I updated my answer to point out at least that the won-position problem in your case is c.e., since for these positions, with only finitely many moves at each stage, a position will be winning for white if and only if it is mate-in-n for some n. | |
| Mar 16, 2014 at 14:24 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 1761 characters in body
|
| Mar 16, 2014 at 14:19 | comment | added | Waldemar | Thanks Joel. Maybe you could kindly give some hints to my question: what are the promising ways which could possibly lead to a proof of the problem decidability? | |
| Mar 16, 2014 at 14:17 | comment | added | Joel David Hamkins | Ah, that is totally different, and our methods do not settle it at all. It seems to be totally open. | |
| Mar 16, 2014 at 13:55 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |