Answers.Body: <p>I think answers to this question fall into 2 categories : problem composition and computer-driven few-pieced endgames' thorough analysis. The second one — to which your discovery belongs — being a tad bit more efficient than the first, that's probably all there is to say about it, if you're about sheer numbers. Art still has a long way to go on this road.</p>
  
  <p>Regarding computer-driven endgames, the longest known so far is <a href="http://tb7.chessok.com/articles/Top8DTM_eng" rel="nofollow noreferrer">549 moves long</a>.</p>
  
  <pre><code>[FEN "1n1k4/6Q1/5KP1/8/7b/1r6/8/8 w - - 0 1"]
  </code></pre>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2013-01-09T01:41:53.377Z
Answers.LastActivityDate: 2020-04-04T21:18:13.587Z
Answers.LastEditDate: 2020-04-04T21:18:13.587Z
Answers.UserDisplayName: Nikana Reklawyks
Body: <p>What known position has one side with a forced mate in N moves, with N the largest? I came across one with 517 moves using only 7 pieces, so there should be much be larger. (Ignoring the 50-move rule).   </p>
  
  <p>Dont know if this is on-topic here, - but how large can we make N (asymptotically) on an nxn chess-board with any number of pieces and placements?</p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2013-01-09T01:43:24.700Z
Comments.Text: [Duplicate maybe ?](http://chess.stackexchange.com/questions/130/are-there-endgames-which-could-be-forced-wins-if-not-for-the-50-move-rule)
Comments.UserDisplayName: Nikana Reklawyks
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2013-01-09T10:32:39.973Z
Comments.Text: Note: the 517 move 7-piecer mentioned in the OP is actually longer than that to mate. The 517 moves are how long it takes, with best play, to reduce the 7-piece position to a won 6-piece ending (which then requires some further moves to mate). See also http://chess.stackexchange.com/a/674/167.
Comments.UserDisplayName: ETD
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2013-01-09T10:36:01.527Z
Comments.Text: Given your interest in the second, asymptotic question, you might find this MathOverflow question about play on an infinite board to be interesting: http://mathoverflow.net/questions/63423/checkmate-in-omega-moves.
Comments.UserDisplayName: ETD
Tags: <analysis><theory><records>
Title: Mate in N. What is the largest N known?
ThreadText: # Mate in N. What is the largest N known?
  
  (Asked by: username_0 on 2013-01-09)
  
  What known position has one side with a forced mate in N moves, with N the largest? I came across one with 517 moves using only 7 pieces, so there should be much be larger. (Ignoring the 50-move rule).
  
  Dont know if this is on-topic here, - but how large can we make N (asymptotically) on an nxn chess-board with any number of pieces and placements?
  
  **Tags:** analysis, theory, records
  
  > **Comments:**
  > **username_1**: [Duplicate maybe ?](http://chess.stackexchange.com/questions/130/are-there-endgames-which-could-be-forced-wins-if-not-for-the-50-move-rule)  
  > **username_2**: Note: the 517 move 7-piecer mentioned in the OP is actually longer than that to mate. The 517 moves are how long it takes, with best play, to reduce the 7-piece position to a won 6-piece ending (which then requires some further moves to mate). See also http://chess.stackexchange.com/a/674/167.  
  > **username_2**: Given your interest in the second, asymptotic question, you might find this MathOverflow question about play on an infinite board to be interesting: http://mathoverflow.net/questions/63423/checkmate-in-omega-moves.  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_1 on 2013-01-09. Score: 3
  
  I think answers to this question fall into 2 categories : problem composition and computer-driven few-pieced endgames' thorough analysis. The second one — to which your discovery belongs — being a tad bit more efficient than the first, that's probably all there is to say about it, if you're about sheer numbers. Art still has a long way to go on this road.
  
  Regarding computer-driven endgames, the longest known so far is [549 moves long](http://tb7.chessok.com/articles/Top8DTM_eng).
  
  ```
  [FEN "1n1k4/6Q1/5KP1/8/7b/1r6/8/8 w - - 0 1"]
  
  ```
  
  
  ---
  
  