[Retros] rstan

[Andrew Buchanan]

Minor error: the shortest line is 6.5 moves, because Bf5+ is required to
eliminate the cook 1.e4.

It's still faster the previous record, but faster still would be the
following version:

1. d3 ... 2. Qd2 ... 3. Qg5+ ... 4. Qe5+ ... 
...
4n+5. Bd2 ... 4n+6. Bc3 ...#
(for n>=0)

This will give a shortest line in 6.0 moves, and incidentally is
capture-free.

Thanks,
Andrew.

-----Original Message-----
From: Andrew Buchanan [mailto:andrew at anselan.com] 
Sent: 02 October 2013 00:27
To: 'The Retrograde Analysis Mailing List'
Subject: RE: [Retros] rstan

Or:
1. ... d6 2. ... Bg4+ 3. ... Bf5+ 4. ... Bg4+ then 1004. ... Bg4+ 1005. ...
Qd7 1006. ... Qb5 1007. #

The shortest line is just 4.5 moves.

I don't think the term "half proof game" is right. Maybe "half synthetic
game"?

Cheers,
Andrew.

-----Original Message-----
From: retros-bounces at janko.at [mailto:retros-bounces at janko.at] On Behalf Of
Noam Elkies
Sent: 01 October 2013 13:02
To: retros at janko.at
Subject: Re: [Retros] rstan

"Andrew Buchanan" <andrew at anselan.com> writes:


> What fun!

>

> The question arises. What is the shortest infinite game? :)


(-:


> Here is a quick effort.

>

> 1.e3 ... 2.Qh5+ ... 3.Qxf5 ... 4.Qxe6+ ... 5.Qxg6+ ... 6.Qe6+ ... 7.Qg6+

...

>

> and eventually something like

> 1008.Qe6+ ... 1009.Ke2 ... 1010.Kd3 ...#

>

> Is it sound? Can it be improved?


An attempted improvement:

1 e3 ... 2 Bd3 ... 3 Bg6+ ... 4 Bf5+ ... 5 Bg6+ ... 6 Bf5+ ...
...
1007 Bxd7 ... 1008 Bxe6 ... 1009 Kf1 ...#

(the repetition actually starts at move 3, not 5)

NDE
_______________________________________________
Retros mailing list
Retros at janko.at
http://www.pairlist.net/mailman/listinfo/retros