[Retros] "half" proof games

[Francois Labelle]

I hope I did everything right.


Richard Stanley:
1.f3 ... 2.Kf2 ... 3.Kg3 ... 4.Kh4 ...# [2 SOLUTIONS]

Noam Elkies:
1 f3 ... 2 Kf2 ... 3 Ke3 ...#  [1 SOLUTION]

Noam Elkies:
1 f3 ... 2 g4 ... 3 fxe4 ...#, [1 SOLUTION]
1 g3 ... 2 Bh3 ... 3 B:e6 ... 4 f4 ...#  [0 SOLUTIONS]
1 d3 ... 2 Bd2 ... 3 Ba5 ... 4 Bxd8 ... 5 Qc1 ...#. [1 SOLUTION]

Ulrich Ring:
1.e4 ... 2.ed5: ... 3.Ke2 [1 SOLUTION]
1.d3 ... 2.Kd2 ... 3.Kc3  [5 SOLUTIONS]

Richard Stanley:
1.g4 ...    2.gh5 ... 3.hg6 ... 4.g7 ... 5.gh8Q+ ...
6.Qxg8+ ... 7.Qxf8+ ... 8.d3 ... 9.Bd2 ... 10.Ba5 ...
11.B6d8 ... 12.Qc1 ...#   [481 SOLUTIONS]

Noam Elkies:
1 e4 ... 2 Q:h5 ... 3 Q:g6 ... 4 Q:f6 ... 5 Q:e5+ ... 6 Q:h8+ ...
7 Qe5+ ... 8 Qh8+ ... 9 Qe5+ ...
10 d3 ... 11 Kd2 ... 12 Kc3 ... 13 Q:h5 ...# [3620696 SOLUTIONS]

Noam Elkies
1 d4 ... 2 Kd2 ... 3 Kd3 ...# [1 SOLUTION]

------

Richard Stanley wrote:


> Are there any longer? Can Francois check up to some number of moves?


I can easily test a given problem, but writing a program to compose such
problems would take too much time. During my next vacation maybe. But
since sometimes a single move can determine a complete game (6. gxf8=N#),
my feeling is that you could guide an infinite game uniquely by providing
even less than just White's moves.

	Francois