Timeline for How far can a pawn get on an infinite chessboard?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 4, 2022 at 1:55 | history | edited | Parcly Taxel | CC BY-SA 4.0 |
deleted 1 character in body
|
| Dec 2, 2022 at 21:46 | comment | added | Paul Sinclair | It is inaccurate to describe the process given in that paper as a "sequence". Indeed, the paper references an earlier result that showed that no sequence, even if indexed over ordinals, not just natural numbers, can reach the fifth row. Ordinals only have infinite ascents. Any decreasing sequence must be finite. But their process requires infinite descents. This is why they structured it with time as a real variable, even though the set of times where changes are made is only countably infinite. | |
| Dec 1, 2022 at 16:17 | vote | accept | 3m0o | ||
| Dec 1, 2022 at 3:07 | comment | added | justhalf | The question doesn't specify that infinite sequence of moves is not allowed. So I guess technically the answer is fifth, then? | |
| Dec 1, 2022 at 1:01 | history | edited | Parcly Taxel | CC BY-SA 4.0 |
added 82 characters in body
|
| Nov 30, 2022 at 23:33 | history | answered | Parcly Taxel | CC BY-SA 4.0 |