[Retros] Challenge

[Kevin Begley]

Hi all,

Unless I have misread Juha Saukkola's challenge, it is rather trivial
to achieve n=infinity with only 6 men...


>Find a such kind of position that there is

>mate in 1 with only one move,

>mate in 2 with only one starting move,

>...

>mate in n with only one starting move.

>maximize n!


Nowhere does it say that the key for each mate (from #2 to #n) must be
unique, so why not:

white Ka1 Bf8 Sf6 Ph6 black Kh8 Ba2  (4+2)

#1 Bg7#
#2 (exact):  1.Kb2!
...
#n (exact):  1.Kb2!   (for all n > 2).

If the keys must all be unique, the challenge is, of course, much tougher.

 Best,
   Kevin.