[Retros] Proofgame maximum lengths and numbers

[A J Mestel]

Let F(n) be the number of unique proofgames n half-moves long.

Fairly obviously F(n) has a maximum somewhere at n=N_0 and
there is a maximum value n=N_1 of those n for which F(n)>0.

Does anyone have an intuitive guess for rough values of N_0 and N_1?

     Jonathan

On Sun, 8 Mar 2009, Joost de Heer wrote:


> Mario Richter wrote:

>> Joost>  In orthodox chess, there are no exact massacre proofgames

>> Joost>  ending with only the kings.

>>

>>  I'd like to repeat Andrew's question: Do you have a source for

>>  your claim?

>

> No, but I highly doubt there'll be a long dualfree orthodox proofgame ending 

> with only kings. So perhaps my wording should read '[..]there are almost 

> certainly no exact [...]'.

>

> Joost

> _______________________________________________

> Retros mailing list

> Retros at janko.at

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

>

>