Timeline for Checkmate in $\omega$ moves?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 12, 2019 at 19:09 | history | suggested | Glorfindel | CC BY-SA 4.0 |
broken image fixed (click 'rendered output' or 'side-by-side' to see the difference); for more info, see https://meta.mathoverflow.net/a/4058/70594
|
| Mar 12, 2019 at 18:23 | review | Suggested edits | |||
| S Mar 12, 2019 at 19:09 | |||||
| May 4, 2011 at 18:44 | comment | added | Noam D. Elkies | [...due to character-count limit] But Black can stop White from playing Nl13. Still I think this back-door route is useful because it seems now that White cannot force the Nxe10xg9 mate with just one Knight if Black uses the roving Rook to control the access path. He can, however, either do that or capture the top Black pawns at f14 and g13; then the threat of Ni14 and Nh12/j12# ties Black to stopping Ni14, and then White can get back to e10 via e14 and f12 after hiding the White King on say j2. | |
| May 4, 2011 at 18:38 | comment | added | Noam D. Elkies | Thanks! And thanks for the corrections: yes, it's $N/2$ squares, not $2N$, and the Knight is on e8, not e7 (I'm not used to navigating such large boards). Is the usual protocol here to make the edit in my original answer even though it leaves your comment hanging? Yes, there's also a potential mating square at j12, though the roving Rook could stop that and still harass the White King from a distance. Better to aim for l13, from which White threatens mates at both j12 and k11; Black can stop both with Rk12, but has no waiting moves and eventually runs out of checks. [cont'd below...] | |
| May 4, 2011 at 8:02 | comment | added | Johan Wästlund | Impressive! I'm unable to find a flaw in the analysis. A couple of trivial remarks, I guess you mean that we reach $N\omega$ by moving the outlying Knight about $2N$ squares to the left? And a bit later the other white knight that mustn't move is on e8, not e7. I guess the roving knight could also try to reach ... let's see ... j12, but that would be even slower. | |
| May 3, 2011 at 19:49 | history | answered | Noam D. Elkies | CC BY-SA 3.0 |