En passant is somewhat of a rare move in chess. Checkmating by en passant, however, is an even rarer occurrence. But suppose both sides had the same goal to help cause a checkmate to their opponent via en passant.

What is the minimum amount of moves needed to checkmate each side by en passant?

  • just to clarify, the original question was meant to ask for a checkmate on both sides. It may not have been clear through the use of “either”, so I changed it to say each – micsthepick May 4 '18 at 11:40

The same question has also been discussed and answered in the lichess forum, and as mentioned by others already, the answer is 11 half-moves for white and 12 half-moves for black. You might find some interesting examples and additional info there. Not knowing that this problem had already been solved before, I did a brute-force proof back then (see my post in the aforementioned thread), since that is feasible for 10-12 ply, i.e., disproving the existence of a solution up to 10 ply by an exhaustive search and finding solutions with 11 and 12 ply, respectively.

Here are displays for said games.

[FEN ""]

1. e4 e6 2. e5 g5 3. Nc3 Nh6 4. Qh5 Ke7 5. Ne4 f5 6. exf6#

[FEN ""]

1. f3 e5 2. Kf2 Qf6 3. Kg3 h5 4. h3 h4+ 5. Kh2 Qxf3 6. g4 hxg3#
| improve this answer | |
  • just to clarify, the original question was meant to ask for a checkmate on both sides. It may not have been clear through the use of “either”, so I changed it to say each – micsthepick May 4 '18 at 11:37
  • Thanks for the clarification, I adjusted my answer to reflect that. – Fabian Fichter May 4 '18 at 11:49
  • @FabianFichter thanks for this. Was your analysis of 11 & 12 ply also exhaustive? If so, that would indicate whether there are any unique proof games of that length. – Laska May 4 '18 at 15:09
  • 1
    @Laska I think for 11 ply it was exhaustive and for 12 ply it wasn't, but I not not clearly remember. I just took Stockfish's perft implementation and printed/counted all final positions that fulfilled the respective requirement (e.g., I did the same for shortest checkmate by a king move), so it was quite simple, but I can not find the code or the results any more. I think I only added one or two conditions to return early if no en passant capture was possible within the remaining search depth in order to speed it up a little bit, since perft 11/12 already takes quite a while. – Fabian Fichter May 4 '18 at 15:41
  • Wow. Now, how about stalemate by an e.p. capture? Has that been solved too? – bof Mar 8 at 6:05

According to this page the shortest known mate by en passant capture is in 5.5 moves (that is, White mates on move 6), and was published by Benko in Chess Live & Review in 1976:

[Title "Pal Benko's 5.5 move e.p. helpmate"]
[Fen "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w - - 0 0"] 

1. e4 e5 2. Qh5 Nc6 3. g4 d6 4. g5 Kd7 5. Bh3+ f5 6. gxf6#
| improve this answer | |
  • 3
    . . . and there are several more recent 5.5 movers tied with it. – Noam D. Elkies May 2 '18 at 1:33
  • this only answers half of the question, how many moves does it take to checkmate white? – micsthepick May 2 '18 at 8:32
  • 6
    @micsthepick : It can't be more than 6.0 (black checkmates on move 6). 1. a3 ... and then the above sequence with white and black swapped would do it. – Martin Bonner supports Monica May 2 '18 at 8:45
  • just to clarify, the original question was meant to ask for a checkmate on both sides. It may not have been clear through the use of “either”, so I changed it to say each. – micsthepick May 4 '18 at 11:39

Thanks for the subject! A natural, fun extension of the question is to ask what is the shortest Unique Proof Game ending in e.p. checkmate. The idea with one of these is you are given just the end state diagram, and the total number of moves, and you must figure out the unique game leading to that point.

I think the current record holder is the following:

[title "Gerd Wilts & Norbert Geissler - RML - 05/1996"]
[fen ""]
[startply "14"]  

1. f4 e5 2. Kf2 Qh4+ 3. Kf3 Qf2+ 4. Kg4 h5+ 5. Kh3 h4 6. e4 d5+ 7. g4 hxg3ep# *

Position after Black's 7th move.

I honestly don't know if this is the best possible: maybe there is another position with a shorter unique proof game.

| improve this answer | |
  • 1
    Is the same diagram without Pf4 also a unique proof game ? 1.e3 e5 2.Ke2 Qh4 3.Kf3 Qxf2 4.Kg4 h5 5.Kh3 h4 6.e4 d5 7.g4 hg3ep# ? – Evargalo May 4 '18 at 13:53
  • 1
    @Evargalo no your suggestion isn't unique. Francois Labelle's Jacobi program at wismuth.com/jacobi identifies 25 routes to the final position. – Laska May 4 '18 at 15:05

There are four kinds en passant checkmates-

  1. The pawn moves, checking the king itself.
  2. The pawn moves, checking the king, while also allowing another piece to check as well, aka a double check.
  3. The pawn moves, not checking the king, as to allow another piece to check the king, aka a discovered check.
  4. The pawn moves, not checking the king itself, as to allow two other pieces to check the king, aka a double discovered check.

Here are the fastest possible games for all four categories, in order. Variations exist of course. To get the fasest checkmates for black, simply reverse each game, always adding on a half a move.

Sources: The Lichess Forums & The Chess Problem Database


[FEN ""]

1. e4 f5 2. exf5 Kf7 3. Qg4 h6 4. b3 Qe8 5. Bb2 g5 6. fxg6#


[FEN ""]

1. e4 d5 2. d4 dxe4 3. d5 Kd7 4. Bc4 Nc6 5. Bg5 Qe8 6. h3 e5 7. dxe6#


[FEN ""]

1. e4 e5 2. g4 Nc6 3. g5 d6 4. Qh5 Kd7 5. Bh3+ f5 6. gxf6#


[FEN ""]

1. c3 f5 2. h4 Kf7 3. Qb3+ Kg6 4. Qf7+ Kh6 5. h5 a6 6. d4+ g5 7. hxg6#
| improve this answer | |
  • In the lichess study linked in my answer there actually are both a direct checkmate as well as a mate by discovered check, both in 11 half-moves. – Fabian Fichter Mar 31 '19 at 17:31

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.