Play chess. Anywhere. Anytime.
25 years of online chess
Sign up on web and sign in on the app.
All your chess games in your pocket.
Or scan with your mobile device.
Elsewhere
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))
cloning vat
I wonder wether being mad is a sign of good chess qualities...😕
Your Blackened Sky
Originally posted by royalchickenGenius, 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))