[Retros] Proofgame maximum lengths and numbers

[Joost de Heer]

> 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?


Intuitive guess for N_0 is somewhere around 30. Intuitive guess for N_1 is 
somewhere around 120. There is at least one dualfree (or rather: 
non-cooked) proofgame in 115 halfmoves, so N_1 is larger than that. I 
suspect it's not much larger.

Joost