Answers.Body: <p>Such a game more than likely doesn't. The game that you give is amazing enough in that 16 already exists. Without access to a database, however, I don't know for sure. Perhaps someone could try to do that, and search in one or two. But again, more than likely it doesn’t exist due to the extreme conditions and setup that a real game would have to arrive at the do it, not to mention that there are two minds involved.</p>
  <p>Just for fun, as a related note that isn't an answer, here is the fastest possible game with such a sequence.</p>
  <pre><code>[Title &quot;me, chess.stackexchange.com 7/3/2020, Non-Unique Proof Game in 15.0 Moves&quot;]
  [FEN &quot;&quot;]
  
  1. e3 e6 2. Qf3 Qf6 3. Qxb7 Qxb2 4. Be2 Be7 5. Nf3 Nf6 6. O-O O-O 7. h3 h6 8. Kh2 Kh7 9. Qxa8 Qxa1 10. Qxb8 Qxb1 11. Qxc8 Qxc1 12. Qxf8 Qxf1 13. Qxe7 Qxe2 14. Qxf6 Qxf3 15. gxf3 gxf6
  </code></pre>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-10-08T21:58:19.727Z
Answers.LastActivityDate: 2021-05-02T16:33:15.230Z
Answers.LastEditDate: 2021-05-02T16:33:15.230Z
Answers.UserDisplayName: Rewan Demontay
Answers.Body: <p>I have made a search on pawn endgames in my database, and here is the definite answer! 21 full moves, it really cracked me up to see it hahahaha.</p>
  <p><a href="http://view.chessbase.com/cbreader/2020/7/3/Game1044992468.html" rel="nofollow noreferrer">http://view.chessbase.com/cbreader/2020/7/3/Game1044992468.html</a></p>
  <p>By the way your above example is not 16 half-moves (that would be 8 full moves). It's 34 full moves.</p>
  <p>Cheers!</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-07-03T21:25:47.740Z
Answers.Text: Okay well, then I messed up. :)
Answers.UserDisplayName: David Miedema
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-07-03T19:29:50.873Z
Answers.LastActivityDate: 2020-07-03T19:29:50.873Z
Answers.UserDisplayName: David Miedema
Body: <p>Is any game known where all the pieces (except the pawns) are still on the board, and where a piece (not a pawn!) is captured at each half-move, leading to a pawn endgame?</p>
  
  <p>In other words, is there a game where a "full" board is transferred to a pawn endgame in only 14 half-moves?</p>
  
  <p>Here a game where the tranformation is made in 16 half-moves:</p>
  
  <pre><code>[Event "URS-ch26"]
  [Site "Tbilisi"]
  [Date "1959.??.??"]
  [Round "15"]
  [White "Kortschnoj, Viktor"]
  [Black "Geller, Efim P"]
  [Result "1-0"]
  [ECO "E69"]
  [PlyCount "83"]
  [EventDate "1959.??.??"]
  [EventType "tourn"]
  [EventRounds "19"]
  [EventCountry "URS"]
  [Source "ChessBase"]
  [FEN ""]
  
  1. d4 Nf6 2. c4 g6 3. g3 Bg7 4. Bg2 O-O 5. Nc3 c6 6. e4 d6 7. Nge2 e5 8. O-O
  Nbd7 9. b3 exd4 10. Nxd4 Nc5 11. h3 Re8 12. Re1 a5 13. Rb1 Nfd7 14. Be3 h5 15.
  Qd2 Ne5 16. Red1 Qe7 17. Kh1 Bf8 18. Re1 Bg7 19. Re2 Qc7 20. f4 Ned7 21. Bg1
  Nf6 22. Nc2 b6 23. Ree1 Bb7 24. Nd4 Re7 25. Re2 Rae8 26. Rbe1 Ncxe4 27. Nxe4
  Nxe4 28. Rxe4 Rxe4 29. Rxe4 Rxe4 30. Bxe4 c5 31. Bxb7 Qxb7+ 32. Qg2 Qxg2+ 33.
  Kxg2 Bxd4 34. Bxd4 cxd4 35. Kf3 Kg7 36. Ke4 Kf6 37. Kxd4 Kf5 38. Ke3 Ke6 39.
  Ke4 Kd7 40. f5 g5 41. Kd5 Kc7 42. g4 1-0
  </code></pre>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2017-08-07T17:34:23.500Z
Comments.Text: Are you looking for a real game or a composed game?
Comments.UserDisplayName: ericw31415
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2017-08-08T17:19:48.200Z
Comments.Text: A real game. It is easy to compose an example with the optimal length
Comments.UserDisplayName: Peter
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2019-08-04T04:44:09.460Z
Comments.Text: If anyone out there has access to a database of games, I think a python script could handle this. You could just split the PGN by spaces, then take moves_only = [pgn_moves[x] for x in range(0, half_move_ary) if x % 3 != 0] as the array. Then if movves_only has 14 elements in a row, flag that.game for later. This would only show us 14 captures in a row, but there probably aren't too many games like that. Or you could just take the FEN after each move, and once the first piece is captured  (RNBQKrnbqk count decreased by 1) verify the same happens the next 13.
Comments.UserDisplayName: aschultz
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2019-09-28T22:53:10.433Z
Comments.Text: btw, the term for "half move" is a ply.
Comments.UserDisplayName: Inertial Ignorance
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2019-10-09T20:10:46.470Z
Comments.Text: I looked at lichess games from 2013 and 2014, and all ccrl4040 games, and lichess games from january 2019 (I don't have any more on my pc, it's ~16M games in total). The best I found was 19, but it's not a lot of games so there are prospects. I can provide software to quickly run through pgn files if someone wants to (~150k games/s). Raw output: https://pastebin.com/fnL8D76x
Comments.UserDisplayName: Sopel
Tags: <pawn-endgame><captures><records>
Title: From a full board to a pawn endgame in the shortest possible number of half-moves
ThreadText: # From a full board to a pawn endgame in the shortest possible number of half-moves
  
  (Asked by: username_0 on 2015-03-31)
  
  Is any game known where all the pieces (except the pawns) are still on the board, and where a piece (not a pawn!) is captured at each half-move, leading to a pawn endgame?
  In other words, is there a game where a "full" board is transferred to a pawn endgame in only 14 half-moves?
  Here a game where the tranformation is made in 16 half-moves:
  [Event "URS-ch26"]
  [Site "Tbilisi"]
  [Date "1959.??.??"]
  [Round "15"]
  [White "Kortschnoj, Viktor"]
  [Black "Geller, Efim P"]
  [Result "1-0"]
  [ECO "E69"]
  [PlyCount "83"]
  [EventDate "1959.??.??"]
  [EventType "tourn"]
  [EventRounds "19"]
  [EventCountry "URS"]
  [Source "ChessBase"]
  [FEN ""]
  
  1. d4 Nf6 2. c4 g6 3. g3 Bg7 4. Bg2 O-O 5. Nc3 c6 6. e4 d6 7. Nge2 e5 8. O-O
  Nbd7 9. b3 exd4 10. Nxd4 Nc5 11. h3 Re8 12. Re1 a5 13. Rb1 Nfd7 14. Be3 h5 15.
  Qd2 Ne5 16. Red1 Qe7 17. Kh1 Bf8 18. Re1 Bg7 19. Re2 Qc7 20. f4 Ned7 21. Bg1
  Nf6 22. Nc2 b6 23. Ree1 Bb7 24. Nd4 Re7 25. Re2 Rae8 26. Rbe1 Ncxe4 27. Nxe4
  Nxe4 28. Rxe4 Rxe4 29. Rxe4 Rxe4 30. Bxe4 c5 31. Bxb7 Qxb7+ 32. Qg2 Qxg2+ 33.
  Kxg2 Bxd4 34. Bxd4 cxd4 35. Kf3 Kg7 36. Ke4 Kf6 37. Kxd4 Kf5 38. Ke3 Ke6 39.
  Ke4 Kd7 40. f5 g5 41. Kd5 Kc7 42. g4 1-0
  
  **Tags:** pawn-endgame, captures, records
  
  > **Comments:**
  > **username_1**: Are you looking for a real game or a composed game?  
  > **username_0**: A real game. It is easy to compose an example with the optimal length  
  > **username_2**: If anyone out there has access to a database of games, I think a python script could handle this. You could just split the PGN by spaces, then take moves_only = [pgn_moves[x] for x in range(0, half_move_ary) if x % 3 != 0] as the array. Then if movves_only has 14 elements in a row, flag that.game for later. This would only show us 14 captures in a row, but there probably aren't too many games like that. Or you could just take the FEN after each move, and once the first piece is captured  (RNBQKrnbqk count decreased by 1) verify the same happens the next 13.  
  > **username_3**: btw, the term for "half move" is a ply.  
  > **username_4**: I looked at lichess games from 2013 and 2014, and all ccrl4040 games, and lichess games from january 2019 (I don't have any more on my pc, it's ~16M games in total). The best I found was 19, but it's not a lot of games so there are prospects. I can provide software to quickly run through pgn files if someone wants to (~150k games/s). Raw output: https://pastebin.com/fnL8D76x  
  
  ---
  
  ## 2 answers
  
  ### Answer by username_5 on 2019-10-08. Score: 3
  
  Such a game more than likely doesn't. The game that you give is amazing enough in that 16 already exists. Without access to a database, however, I don't know for sure. Perhaps someone could try to do that, and search in one or two. But again, more than likely it doesn’t exist due to the extreme conditions and setup that a real game would have to arrive at the do it, not to mention that there are two minds involved.
  Just for fun, as a related note that isn't an answer, here is the fastest possible game with such a sequence.
  [Title "me, chess.stackexchange.com 7/3/2020, Non-Unique Proof Game in 15.0 Moves"]
  [FEN ""]
  
  1. e3 e6 2. Qf3 Qf6 3. Qxb7 Qxb2 4. Be2 Be7 5. Nf3 Nf6 6. O-O O-O 7. h3 h6 8. Kh2 Kh7 9. Qxa8 Qxa1 10. Qxb8 Qxb1 11. Qxc8 Qxc1 12. Qxf8 Qxf1 13. Qxe7 Qxe2 14. Qxf6 Qxf3 15. gxf3 gxf6
  
  
  ---
  
  ### Answer by username_6 on 2020-07-03. Score: 1
  
  I have made a search on pawn endgames in my database, and here is the definite answer! 21 full moves, it really cracked me up to see it hahahaha.
  
  <http://view.chessbase.com/cbreader/2020/7/3/Game1044992468.html>
  
  By the way your above example is not 16 half-moves (that would be 8 full moves). It's 34 full moves.
  
  Cheers!
  
  > **Comments:**
  > **username_6**: Okay well, then I messed up. :)  
  
  ---
  
  