[Retros] Min dual-free SPG where each survivor has moved.

[Eric Angelini]

Thanks, Andrew, and congratulations !
(BTW my proof game was 14.5 moves long...)
I'll try now to re-construct your 13.5 moves.
Could you mail me here your solution, in case
I would turn crazy eric.angelini at kntv.be ?
Regards,
EA


----- Original Message -----
From: "Andrew Buchanan" <andrew at anselan.com>
To: <retros at janko.at>
Sent: Thursday, May 02, 2002 4:16 AM
Subject: [Retros] Min dual-free SPG where each survivor has moved.



> Noam Elkies originally asked for a dual-free SPG in which every unit

moved.

> Eric Angelini claimed an SPG in 14.0 in which every *surviving* unit

moved.

>

> Here is a dual-free SPG in 13.5 in which every *surviving* unit moved

(proof

> by Euclide 0.91). It is easy to see that the task cannot be satisfied in

> fewer moves.

>

> 5rk1/1BQnbR2/5np1/8/2P1P3/2N5/4Nrq1/2KR4

> (9+8) SPG in 13.5.

>

> Enjoy!

> Andrew Buchanan

>

> _______________________________________________

> Retros mailing list

> Retros at janko.at

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

>