6
$\begingroup$

In chess, it is possible to double check whilst giving promotion. An example of this would be a pawn promoting to a queen while a discovered attack from a rook behind the pawn checks the opponent’s king. Both the new queen and rook check at the same time, thus making it a double check.

Construct a sequence of promotions with double check with maximal possible length. Assume that white is to move first and black is to help. You must also prove your answer to be optimal via any reasonable method.

Good luck!

$\endgroup$
  • $\begingroup$ I saw a close vote for this question being too broad, so I edited the question to remove “that you can,” which could be construed as allowing for subjective answers $\endgroup$ – PiIsNot3 May 1 at 3:30
  • $\begingroup$ Sounds good to me! $\endgroup$ – Rewan Demontay May 1 at 11:10
4
$\begingroup$

I now have

Four double checks by promotion in a row.

FEN: B1nQ2B1/1P1PPP2/2k5/8/8/8/8/7K w - -

Game: 1. b8=N+ Kd6 2. dxc8=N+ Ke6 3. f8=N+ Kf6 4. e8=N+

Apronus link


Proof that it is optimal: UNDER EDIT

A double check can occur either by a classic discovery, or by an en-passant capture. The latter is impossible here so it has to be a discovery. There are three cases:

Type A: Black King in the 8th rank right in front of the pawn to be promoted, promotion = Q or R, with another Q or R in the same column as the King.

Type B: Black King in the 7th rank, checked by Rook or Queen also on the 7th rank; all four types of promotions can occur.

Type C: Black King in the 6th rank, attacking-close to the pawn to be promoted. Promotion = Q or R or N, while the other checking piece can be anything.

Now here is why there can't be too many moves:

Fact 1: there can be only one type A in the sequence. Because (long story short) the King has to leave the 8th rank and it can never come back.
Fact 2: there can be only one type B in the sequence. Because (long story short) the King has to leave the 7th rank and it can never come back.
Therefore the only possible sequences are (possibly truncated) ABCCC... and ...CCCBA.

$\endgroup$
3
$\begingroup$

I’ve managed to do

3 discovered checks, assuming that capture promotions are allowed.

The setup:

FEN: 3nnBB1/RP1kPP2/8/8/8/8/8/7K w - - 0 1

The game:

1. b8=N+ Kd6 2. exd8=R+ Ke6 3. fxe8=R+

Lichess link

I have a feeling we can do a bit better than that, but as of now this is the best I can get.

$\endgroup$
  • $\begingroup$ That’s allowed alright! $\endgroup$ – Rewan Demontay May 1 at 0:02
  • $\begingroup$ I now have one more, but a proof of optimality doesn't seem easy. $\endgroup$ – Arnaud Mortier May 1 at 1:21
  • $\begingroup$ Yep. Whether or not 5 is possible is nagging at me. 6 is definitely impossible. $\endgroup$ – Rewan Demontay May 1 at 1:26
  • $\begingroup$ Really thought I had a 5, but missed the promoted piece causing a second check, and can't get around that yet. $\endgroup$ – Joel Rondeau May 7 at 14:23
  • $\begingroup$ Well that’s quite a blow. $\endgroup$ – Rewan Demontay May 22 at 19:24

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.