Body: <p>According to the rules of algebraic notation, in order for a move to be recorded with rank and file for both starting and ending square (eg, <code>Be5f4</code>), there would need to be, at a minimum:</p>
  <ul>
  <li>three pieces of the same type</li>
  <li>two of which share the same rank</li>
  <li>two of which share the same file</li>
  <li>all three of which can move to the target square</li>
  </ul>
  <p>I believe this would require a minimum of either 1 knight promotion, 2 queen promotions, or 2 bishop promotions.</p>
  <p>Has such a move ever been recorded in a masters level chess game?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-03-19T08:08:02.230Z
Comments.Text: https://timkr.home.xs4all.nl/records/records.htm is the first place to check, but not of the games there (nor the forged Alekhine-Grigoriev 5 queens game) contains a move that fits.
Comments.UserDisplayName: Evargalo
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-03-20T02:18:26.067Z
Comments.Text: I do have a proof game composition that contains this. It was constructed  a couple of years ago to highlight the fact that the PDB problem database animation engine does not support the standard notation for this kind of move. It’s completely artificial but it’s fun to find the unique solution. I can post it as an answer here if the question is broadened
Comments.UserDisplayName: Laska
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-03-20T02:37:05.907Z
Comments.Text: Thanks, but I don't think we need that. I was also able to construct a game in which Be4f5# was the winning move. Curious what you mean about "the unique solution" though?
Comments.UserDisplayName: Steve Bennett
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-03-21T05:06:54.327Z
Comments.Text: I mean that it’s a “unique proof game” puzzle. There is only one game which leads to the final position in the required number of moves
Comments.UserDisplayName: Laska
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-03-22T06:33:24.517Z
Comments.Text: OIC - there is not only one possible position that meets the requirements, but for the given position, there is only one possible game that gets there.
Comments.UserDisplayName: Steve Bennett
Tags: <notation><famous-games><master-games>
Title: Have any full rank-and-file piece specifications ever been required in a masters level game of chess?
ThreadText: # Have any full rank-and-file piece specifications ever been required in a masters level game of chess?
  
  (Asked by: username_0 on 2024-03-19)
  
  According to the rules of algebraic notation, in order for a move to be recorded with rank and file for both starting and ending square (eg, `Be5f4`), there would need to be, at a minimum:
  
  * three pieces of the same type
  * two of which share the same rank
  * two of which share the same file
  * all three of which can move to the target square
  
  I believe this would require a minimum of either 1 knight promotion, 2 queen promotions, or 2 bishop promotions.
  
  Has such a move ever been recorded in a masters level chess game?
  
  **Tags:** notation, famous-games, master-games
  
  > **Comments:**
  > **username_1**: https://timkr.home.xs4all.nl/records/records.htm is the first place to check, but not of the games there (nor the forged Alekhine-Grigoriev 5 queens game) contains a move that fits.  
  > **username_2**: I do have a proof game composition that contains this. It was constructed  a couple of years ago to highlight the fact that the PDB problem database animation engine does not support the standard notation for this kind of move. It’s completely artificial but it’s fun to find the unique solution. I can post it as an answer here if the question is broadened  
  > **username_0**: Thanks, but I don't think we need that. I was also able to construct a game in which Be4f5# was the winning move. Curious what you mean about "the unique solution" though?  
  > **username_2**: I mean that it’s a “unique proof game” puzzle. There is only one game which leads to the final position in the required number of moves  
  > **username_0**: OIC - there is not only one possible position that meets the requirements, but for the given position, there is only one possible game that gets there.  
  
  ---
  
  ## 0 answers
  
  