[Retros] Two little SPG-challenges

Noam Elkies elkies at math.harvard.edu
Mon Nov 29 22:57:05 EST 2004

Previous message: [Retros] Two little SPG-challenges
Next message: [Retros] Minor corrections Re: shortest LS-SPG challenge
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Francois asks:

> What is the *shortest* At-Home LS-SPG (> 0.0 moves)?

> Maybe I can compute/confirm this one.

At most 7.0 moves (-Rh1 -Pb2,g2,h1; -Qd8 -Pc7,f7,h7; C+ Popeye <2min.)

Attempts like 1 Nc3 Nc6 ... 3 N:e7 N:e2 ... 6 Nb1 Nb8 fail
(symmetrically: 1 e3 2 e4 3 Nf3 4 N:e5 5 Nf3 6 Ng1).

NDE

Previous message: [Retros] Two little SPG-challenges
Next message: [Retros] Minor corrections Re: shortest LS-SPG challenge
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the Retros mailing list