[Retros] Task

[Nicolas.Dupont at math.univ-lille1.fr]

>> In the web-site "France-Echecs", I proposed the following problem :

>> Construct the shortest possible exact proof game ending by a check-mate

>> given by a piece returning at home.

>

> What's the link?


http://www.france-echecs.com/


>> Knight with capture : not least [...]

>

> What does "not least" mean?


It means that even if we accept that some capture occurs during the game,
we were unable to find a shortest one.


>> Rook without capture : 9 moves (Itamar Faybish)

>

> This at least is not optimal:

>

> 1 f3 h5 2 Kf2 h4 3 Qe1 h3 4 Kg3 Nf6 5 Qf2 Rg8 6 Kh4 Se4 7 g3 f5 8 Qg2 Rh8#


Very nice game, and quickly realised !