[Retros] Fwd: Proof game promotion task
juha_saukkola at hotmail.com
Mon May 10 01:06:02 EDT 2010
Sounds quite difficult task, but if you really want to see it happen,
offer some money for first solution!
> To: joose_norri at hotmail.com; retros at janko.at
> Date: Sun, 9 May 2010 22:53:18 -0400
> From: elkies at math.harvard.edu
> CC: tchow at alum.mit.edu
> Subject: Re: [Retros] Fwd: Proof game promotion task
> Tim Chow asked:
> > [...] What is the most number of knights (or queens, or whatever)
> > to appear in the set position of a proof game [with a unique solution]?
> Joose Norri responds:
> > Yes, obviously one could do -- but why!? Sorry, missed the irony.
> I don't see why this need be ironic or ugly; it looks to me like a
> legitimate task. And it certainly *doesn't* look obvious that one can
> promote all White pawns to Bishops in a sound proof game! For starters
> such a game must have length at least 39.5, and it's already nontrivial
> to attain such lengths at all, let alone with 40 pawn moves on one side.
> Retros mailing list
> Retros at janko.at
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Retros