user1656: The "Fireside Book of Chess" by I. Chernev and F. Reinfeld includes the following diagram
[fen "3nk3/3NN3/3PP3/3BB3/3PP3/3PP3/3PP3/2RQKR2 w - - 0 1"]


Composed by J.N. Babson for Brentano's Chess Monthly in 1882. Mate on
the 1220th move, after compelling Black to make three successive and
complete Knight's tours.

(Note that there is a mate in one. The problem asks for something more specific.)
Facts:

Babson is a real composer, famous for long mate problems.
Brentano's Chess Monthly was a real publication from 1880 to 1882, and Babson did have problems published there.
A FIDE page that lists people with FIDE titles has a biographical sketch of Babson citing a 1220 move problem, and a 1990 move problem on a 10x10 board.

Issues:

I can't find any reference to this problem on the web, other than the above mentioned book.
Nobody ever mentions any problem with this many moves... anywhere!
A knight tour is the motion of a knight through all the board squares. Three of these would mean only 192 moves.

So here are my questions:


Is the problem for real?
How should one interpret the knight tour condition? Probably the knight will capture most of the central pieces, but do the other pieces have to move aside to let the knight through?
What is the solution?
Why is this not more widely known?



user1382: Looking at the position and the phrasing of the question, I would have to say that the problem is flawed. The directions are far too restrictive - how can white compel black to make three knight tours? If this was defined as a helpmate that's solvable in 1220 moves, then the problem would make more sense. However, even in this case, I cannot fathom how that would be possible as the number of moves that a three knight tours sum to is far less than 1220.

user8084: To force the knight into a corner a piece must be sacrificed. 3 knight tours, 4 corners per tour, so that's 12 White pieces that must be lost. And none of the lost pieces can be knights (from where did it get there to give check?).

user15543: After some searching, it turns out that this monster is very much a real chess problem. The official name for it is  "The Obelisk."
The earliest known reference I have found is from February of 1882, mere weeks after its publication. Bizarrely, it comes from an Australian magazine. The site I found it on is trove.nla.gov.au.
It appears in the February 25th, 1882 edition of the South Australian Weekly Chronicle, published in Adelaide, on page 25. It is part of an overall review of Brentano's January 1882 issue.
Here is a clipping of the relevant section to read for yourself.

I also found mention of it in the "American Chess Review, Volume 1, Issues 1-6"readable on Google books. It is dated to 1886, four years later.
The information is given in the middle of the page. The position itself is given near the end of the page in descriptive notation. More about what that is on Wikipedia. For your information, the "S" is the German notation for the knight; it was semi-standard back then.

Here are later sources.

Chess Review 1936, issue 37 page 17; viewable online in the US Chess Federation's online archive
Curious Chess Facts, by Irving Chernev, 1937
Wonders and Curiosities of Chess, page 205, by Irving Chernev, 1974
The Complete Chess Addict, by Mike Fox & Richard James, 1987
The Even More Complete Chess Addict, by Mike Fox & Richard James, 1994

Unsurprisingly, there is no solution given anywhere at all. The reason for this is that the magazine ceased publication soon after the mate in 1220 was printed. Thus, another edition with the solution was never made.
As for how to interpret the stipulation, I believe it is very simple. White forces the Black knight to visit each and every square three times. Then White gives checkmates. Most of the moves come from White's pieces dancing around to do said forcing. If anyone is crazy enough to try and solve it, they will surely find a much shorter solution than whatever Babson had in mind.
However, when it comes to solving the problem, I have found a sequence that allows for all of White's pawns to be promoted. This is surely more than enough force for the whole solution for whosoever seeks to truly solve it.
[FEN "3nk3/3NN3/3PP3/3BB3/3PP3/3PP3/3PP3/2RQKR2 w - - 0 1"]

1. Nf6+ Kf8 2. Nh7+ Ke8 3. Qa4+ Nc6 4. Qb5 Kd8 5. Qb6+ Ke8 6. d7+ Kxe7 7. Bf6+ Kd6 8. Qa6 Kc7 9. e5 Kb8 10. Qb6+ Ka8 11. Qb5 Ka7 12. Ra1+ Na5 13. Bc4 Ka8 14. e7 Ka7 15. d5 Ka8 16. e8=Q+ Ka7 17. Qh5 Ka8 18. d6 Ka7 19. Be6 Ka8 20. d8=Q+ Ka7 21. Bc8 Ka8 22. e6 Ka7 23. d7 Ka8 24. e7 Ka7 25. d4 Ka8 26. d5 Ka7 27. d6 Ka8 28. e4 Ka7 29. e5 Ka8 30. e6 Ka7 31. d4 Ka8 32. e4 Ka7 33. d5 Ka8 34. e5 Ka7 35. Qh8 Ka8 36. e8=Q Ka7 37. Qeg8 Ka8 38. d8=Q Ka7 39. Qdf8 Ka8 40. e7 Ka7 41. e8=Q Ka8 42. Qeg6 Ka7 43. e6 Ka8 44. e7 Ka7 45. e8=Q Ka8 46. Qee6 Ka7 47. d7 Ka8 48. d8=Q Ka7 49. d6 Ka8 50. d7 Ka7 51. Qde8 Ka8 52. d8=Q Ka7


1656: <p>The <em>&quot;Fireside Book of Chess&quot;</em> by I. Chernev and F. Reinfeld includes the following diagram</p>
<pre><code>[fen &quot;3nk3/3NN3/3PP3/3BB3/3PP3/3PP3/3PP3/2RQKR2 w - - 0 1&quot;]
</code></pre>
<blockquote>
<p>Composed by J.N. Babson for Brentano's Chess Monthly in 1882. Mate on
the 1220th move, after compelling Black to make three successive and
complete Knight's tours.</p>
</blockquote>
<p>(Note that there is a mate in one. The problem asks for something more specific.)</p>
<p>Facts:</p>
<ul>
<li>Babson is a real composer, famous for long mate problems.</li>
<li>Brentano's Chess Monthly was a real publication from 1880 to 1882, and Babson did have problems published there.</li>
<li>A FIDE page that lists people with FIDE titles has a biographical sketch of Babson citing a 1220 move problem, and a 1990 move problem on a 10x10 board.</li>
</ul>
<p>Issues:</p>
<ul>
<li>I can't find any reference to this problem on the web, other than the above mentioned book.</li>
<li>Nobody ever mentions any problem with this many moves... anywhere!</li>
<li>A knight tour is the motion of a knight through all the board squares. Three of these would mean only 192 moves.</li>
</ul>
<p>So here are my questions:</p>
<blockquote>
<ol>
<li>Is the problem for real?</li>
<li>How should one interpret the knight tour condition? Probably the knight will capture most of the central pieces, but do the other pieces have to move aside to let the knight through?</li>
<li>What is the solution?</li>
<li>Why is this not more widely known?</li>
</ol>
</blockquote>
 1382: <p>Looking at the position and the phrasing of the question, I would have to say that the problem is flawed. The directions are far too restrictive - how can white compel black to make three knight tours? If this was defined as a <a href="http://en.wikipedia.org/wiki/Helpmate" rel="nofollow">helpmate</a> that's solvable in 1220 moves, then the problem would make more sense. However, even in this case, I cannot fathom how that would be possible as the number of moves that a three knight tours sum to is far less than 1220.</p>
 8084: <p>To force the knight into a corner a piece must be sacrificed. 3 knight tours, 4 corners per tour, so that's 12 White pieces that must be lost. And none of the lost pieces can be knights (from where did it get there to give check?).</p>
 15543: <p>After some searching, it turns out that this monster is very much a real chess problem. The official name for it is  &quot;The Obelisk.&quot;</p>
<p>The earliest known reference I have found is from February of 1882, mere weeks after its publication. Bizarrely, it comes from an Australian magazine. The site I found it on is <a href="https://trove.nla.gov.au/" rel="nofollow noreferrer">trove.nla.gov.au</a>.</p>
<p>It appears in the February 25th, 1882 edition of the South Australian Weekly Chronicle, published in Adelaide, on <a href="https://trove.nla.gov.au/newspaper/page/8726663#" rel="nofollow noreferrer">page 25</a>. It is part of an overall review of Brentano's January 1882 issue.</p>
<p>Here is a clipping of the relevant section to read for yourself.</p>
<p><a href="https://i.stack.imgur.com/GfA5L.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/GfA5L.png" alt="enter image description here" /></a></p>
<p>I also found mention of it in the <a href="https://www.google.com/books/edition/American_Chess_Review/y6uBo98GjoUC?hl" rel="nofollow noreferrer">&quot;American Chess Review, Volume 1, Issues 1-6&quot;</a>readable on Google books. It is dated to 1886, four years later.</p>
<p>The information is given in the middle of the page. The position itself is given near the end of the page in descriptive notation. More about what that is on <a href="https://en.wikipedia.org/wiki/Descriptive_notation" rel="nofollow noreferrer">Wikipedia.</a> For your information, the &quot;S&quot; is the German notation for the knight; it was semi-standard back then.</p>
<p><a href="https://i.stack.imgur.com/4SbOp.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/4SbOp.png" alt="enter image description here" /></a></p>
<p>Here are later sources.</p>
<blockquote>
<p>Chess Review 1936, issue 37 page 17; viewable online in the US Chess Federation's <a href="https://new.uschess.org/chess-life-digital-archives" rel="nofollow noreferrer">online archive</a></p>
<p>Curious Chess Facts, by Irving Chernev, 1937</p>
<p>Wonders and Curiosities of Chess, page 205, by Irving Chernev, 1974</p>
<p>The Complete Chess Addict, by Mike Fox &amp; Richard James, 1987</p>
<p>The Even More Complete Chess Addict, by Mike Fox &amp; Richard James, 1994</p>
</blockquote>
<p>Unsurprisingly, there is no solution given anywhere at all. The reason for this is that the magazine ceased publication soon after the mate in 1220 was printed. Thus, another edition with the solution was never made.</p>
<p>As for how to interpret the stipulation, I believe it is very simple. White forces the Black knight to visit each and every square three times. Then White gives checkmates. Most of the moves come from White's pieces dancing around to do said forcing. If anyone is crazy enough to try and solve it, they will surely find a much shorter solution than whatever Babson had in mind.</p>
<p>However, when it comes to solving the problem, I have found a sequence that allows for all of White's pawns to be promoted. This is surely more than enough force for the whole solution for whosoever seeks to truly solve it.</p>
<pre><code>[FEN &quot;3nk3/3NN3/3PP3/3BB3/3PP3/3PP3/3PP3/2RQKR2 w - - 0 1&quot;]

1. Nf6+ Kf8 2. Nh7+ Ke8 3. Qa4+ Nc6 4. Qb5 Kd8 5. Qb6+ Ke8 6. d7+ Kxe7 7. Bf6+ Kd6 8. Qa6 Kc7 9. e5 Kb8 10. Qb6+ Ka8 11. Qb5 Ka7 12. Ra1+ Na5 13. Bc4 Ka8 14. e7 Ka7 15. d5 Ka8 16. e8=Q+ Ka7 17. Qh5 Ka8 18. d6 Ka7 19. Be6 Ka8 20. d8=Q+ Ka7 21. Bc8 Ka8 22. e6 Ka7 23. d7 Ka8 24. e7 Ka7 25. d4 Ka8 26. d5 Ka7 27. d6 Ka8 28. e4 Ka7 29. e5 Ka8 30. e6 Ka7 31. d4 Ka8 32. e4 Ka7 33. d5 Ka8 34. e5 Ka7 35. Qh8 Ka8 36. e8=Q Ka7 37. Qeg8 Ka8 38. d8=Q Ka7 39. Qdf8 Ka8 40. e7 Ka7 41. e8=Q Ka8 42. Qeg6 Ka7 43. e6 Ka8 44. e7 Ka7 45. e8=Q Ka8 46. Qee6 Ka7 47. d7 Ka8 48. d8=Q Ka7 49. d6 Ka8 50. d7 Ka7 51. Qde8 Ka8 52. d8=Q Ka7
</code></pre>
