kevinjbegley at gmail.com
Sat Nov 28 12:19:52 EST 2009
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.
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)
#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.
More information about the Retros