﻿﻿ MatPlus.Net

Website founded by
Milan Velimirović
in 2006

4:58 UTC
 ISC 2020

Remember me

 CHESS SOLVINGTournamentsRating lists1-Apr-2020
 B P C F

MatPlus.Net Forum General how many flights can a keymove give?

### how many flights can a keymove give?

Can the key-move of a directmate twoer give more than 4 flights? I have seen several where the key gives 4 flights. In one especially nice problem the key gave all the four flights for a star-flight (but it had the drawback that black was in stalemate initially). Any problem beating that?

W. Shinkman, Der Westen 1902
(= 5+1 )

#2

WinChloe contains a total of 13 #2 with a key granting 5 flights and one problem with a key granting 6 flights...using a checking key. Since this seems to be the record I give it here:

Jaques FULPIUS
after Otto WURZBURG & William A. SHINKMAN
Le Journal de Genève 1972
(= 10+5 )

‡2 (10+5) C+

1.Sd4+! R~ 2.c×d8=Q‡

Actually, it is probably impossible to show a key that give six flights without check since there is no possible move that would protect the seven necessary fields for a mating move at once (the king's field and six around it).
However, maybe zugzwang can do even this miracle but I don't see how.

see my next post

@Dmitri, Pat.
Thanks for the problems. Actually I was trying a scheme giving five flights, but seeing the ancient problems quoted, will stop work on it!
@Seigfried
Actually a vertical Rook+P battery with a pawn promoting to queen capturing a black piece will guard the seven squares. But while it can be a threat, no variations can be worked on it (unless it is dummy black piece!!). However to force a non-checking key giving the six flights will be impossible.

Yes, I also realised in the meantime that it only works like in the diagram, because the front piece of the battery must also give a flight without taking one, so only a knight at this distance works.

Oh, the dummy wouldn't be the problem - in the Fulpius problem,
replace the bishop d8 by a knight and add pawns on b7 c6 f7. See?
Artificial knight dummy. :-)

Hauke

This seems to be a pretty boring constructional task. A real challenge is to grant as much flights as possible and meet them with different mates. Here 5 seems to be the maximum like in the classic with mate on 6 squares by Ua Tane and a more subtle (quiet key!!) masterpiece by Michael McDowell.

Ua Tane
Good Companion 1918
(= 12+6 )
#2 (1.Sc4+)

Michael McDowell
The Problemist 1986
(= 12+4 )
#2 (1.Sce3!!)

Not even commendations for this wonderful problem by McDowel?

Everybody still in shock and awe :-)

Hauke