[Retros] At home proof games in 7.0 moves

[Juha Saukkola]

>I count the number of solutions of every goal diagram that can be obtained 

>(in this case "at-home" diagrams And nowadays I keep track of the solutions 

>for the problems that have 1,2 or 3 solutions. Note that the solutions 

>could instead be found by a proof game solver afterwards, but in general 

>that's a bad idea because sometimes my computer comes up with tough 

>problems.


The idea "number of solutions" in n moves came again.
What is the smallest m, that there are no position of m solutions in spg's.