So this forum doesn't atrophy completely...

Genius, many formulas express recursion. Mine was f(n,m) = f(n-m,m) + f(n,m-1).

I mistyped. The final thing should be:

f(500,4) = SUM([n=0 to 125] SUM([k=0 to 4n/3] [(4n-3k)/2] + [4n/3]+1))

I wonder wether being mad is a sign of good chess qualities...😕

Originally posted by royalchicken
Genius, many formulas express recursion. Mine was f(n,m) = f(n-m,m) + f(n,m-1).

I mistyped. The final thing should be:

f(500,4) = SUM([n=0 to 125] SUM([k=0 to 4n/3] [(4n-3k)/2] + [4n/3]+1))

yeah-well, i've heard of recursion then...😛 erm-what's recursion?...