[Retros] Challenge

[andrew buchanan]

Sorry to go on about it Juha, but as far as the infinite case is concerned, I think the minimum position has 5 units, e.g.:

8/8/8/8/8/8/7p/3BK1bk
#n exactly, for all n


The key is well defined for each #n, but later play is not unique, short mates exist, and keys are not unique over all n.

All the best,
Andy.



________________________________
From: Juha Saukkola <juha_saukkola at hotmail.com>
To: retros at janko.at
Sent: Sun, November 29, 2009 11:20:08 AM
Subject: Re: [Retros] Challenge

 I meant that keys must be unique and i found best positions
from endgame database.

Other question might be that how many different moves can lead
to mates of different lengths (so not needed 1,2,3,...).

Of course all other ideas are worth examining as well!

Juha


> Date: Sat, 28 Nov 2009 09:19:52 -0800

> From: kevinjbegley at gmail.com

> To: retros at janko.at

> Subject: Re: [Retros] Challenge

> 

> 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.

> _______________________________________________

> Retros mailing list

> Retros at janko.at

> http://www.pairlist.net/mailman/listinfo/retros

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.pairlist.net/pipermail/retros/attachments/20091129/9e883e33/attachment.htm>