[Retros] rstan

[Andrew Buchanan]

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?

Cheers,
Andrew.

-----Original Message-----
From: retros-bounces at janko.at [mailto:retros-bounces at janko.at] On Behalf Of
Francois Labelle
Sent: 01 October 2013 08:50
To: retros at janko.at
Subject: Re: [Retros] rstan

You asked the same question in 2004! :)

See your post titled '"half" proof games' on
http://www.pairlist.net/pipermail/retros/2004-February/date.html
and the ensuing replies.

In particular, NDE provided an infinite game:

1. e4 ... 2. Qxh5 ... 3. Qxg6 ... 4. Qxf6 ... 5. Qxe5+ ... 6. Qxh8+ ...
7. Qe5+ ... 8. Qh8+ ... 9. Qe5+ ... and eventually something like 1009. Qe5+
... 1010. d3 ... 1011. Kd2 ... 1012. Kc3 ... 1013. Qxh5 ...#

     François

On 09/30/2013 07:43 PM, Richard Stanley wrote:

>

> Related to games determined by their first and last moves is the 

> following well-known problem. In a game of chess White playes 1.f3

> 2.Kf2 3.Kg3 4.Kh4, after which Black mates White (on Black's fourth 

> move). What are Black's moves?

>

> The solution is e5/e6, Qf6, Qxf3+, Be7, so not quite unique if indeed 

> this is the only solution. This suggests problems like the following:

> what is the largest n such that if White's (or Black's) first n moves 

> are specified, then there is a unique game in which Black mates White 

> (or White mates Black) after the specified moves? As an example that 

> such a problem is possible, but with no attempt to maximize n:

> 1.e4 2.e5 3.Ke2.

>

> Richard

>

> _______________________________________________

> Retros mailing list

> Retros at janko.at

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


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