AW: [Retros] SPG task (1+1)

[paul raican]

Ok, Gerd (and his computer) produced an interesting problem. 
Congratulations!
A second opened question occured:
It is possible a similar problem in Einstein inverse? Or a similar problem 
in Losing Chess(Qui perd gagne) with:
  a) a King
  b) another piece (except King) black or white.
    Paul



>From: CAILLAUDM at aol.com

>Reply-To: retros at janko.at

>To: retros at janko.at

>Subject: Re: AW: [Retros] SPG task (1+1)

>Date: Mon, 26 Jan 2004 14:15:08 EST

>

>Dans un e-mail daté du 25/01/2004 19:15:14 Pays arabes,

>g.wilts at mnet-online.de a écrit :

>

> > >Open question: Make an exact PG in Anti-Andernach, which ends with two

> > Kings.

> > >  Paul Raican

> >

> > There is no such PG in 16,0 moves although 39 different positions with 

>two

> > Kings only can be reached in 16,0 moves in Anti-Andernach. But with 

>Einstein

> > Chess it seems possible to construct a Kings-only PG:

> >

> > Gerd Wilts

> > 8/4k3/8/8/8/8/4K3/8

> > +---+---+---+---+---+---+---+---+

> > |   | . |   | . |   | . |   | . |

> > +---+---+---+---+---+---+---+---+

> > | . |   | . |   |*K |   | . |   |

> > +---+---+---+---+---+---+---+---+

> > |   | . |   | . |   | . |   | . |

> > +---+---+---+---+---+---+---+---+

> > | . |   | . |   | . |   | . |   |

> > +---+---+---+---+---+---+---+---+

> > |   | . |   | . |   | . |   | . |

> > +---+---+---+---+---+---+---+---+

> > | . |   | . |   | . |   | . |   |

> > +---+---+---+---+---+---+---+---+

> > |   | . |   | . | K | . |   | . |

> > +---+---+---+---+---+---+---+---+

> > | . |   | . |   | . |   | . |   |

> > +---+---+---+---+---+---+---+---+

> > (1+1)   PG in 16,5

> > Einstein

> >

> > 1. d4 c5 2. Lg5[=wS] cxd4[=sS] 3. Sxh7[=wL] Sxe2[=sL] 4. Lxg8[=wT] 

>Txh2[=sD]

> > 5. Txg7[=wD] Lxg7[=sT] 6. Txh2[=wD] Txg2[=sD] 7. Dxb8 Dxg1 8. Dxa7 Dxf2+

> > 9. Dxf2 Txa2[=sD] 10. Dxf7+ Kxf7 11. Dxd7 Dxb2 12. Dxc8 Dxb1+

> > 13. Txb1[=wD] Dxc8 14. Dxb7 Dxc2 15. Dxe7+ Kxe7 16. Lxe2[=wT]+ Dxe2+ 17.

> > Kxe2

> >

> > I used a computer to construct this PG. As I used hash tables the 

>program

> > might give PGs where moves can be transposed, so the resulting PGs must 

>be

> > checked

> > manually for move transpositions. In this case no transposition seem

> > possible.

> >

> > Cheers,

> >

> > Gerd Wilts

> >

> >

>  It can also easily be checked not manually but by Popeye : C+ !

>

>  Best,

>   Michel

>


_________________________________________________________________
MSN Search, le moteur de recherche qui pense comme vous ! 
http://search.msn.fr/worldwide.asp