[Retros] Messigny-Retros: "Ready-Made"

Noam Elkies elkies at math.harvard.edu
Fri May 24 20:20:18 EDT 2013

Kevin Begley <kevinjbegley at gmail.com> writes:

> It would be interesting if a program could sift through a large game

> database, and find the longest unique game.


> I imagine the Trompowsky Attack might offer good prospects.

> e.g., 1.d4 Nf6 2.Bg5 Ne4 3.Bh4 g5 4.f3 gxh4 5.fxe4

Interesting. There's also a plausible 7-mover without captures,
with White going 1 d4 2 Bf4 3 e3 4 Bd3 5 Ne2 6 0-0 7 Re1 and
Black symmetrically.


More information about the Retros mailing list