Code:
n
κ(n,m,{B}) = ∏ ki - ∑ κ(n,i,{B})
i Є {B} i=m+1
Ganchrow, I'm attempting to code up a program using the recursive method you outline above, but when trying to relate your examples to the single bet scenario (a 1-team parlay as you say), the examples you show aren't making it clear for me.
I understand how the method is supposed work when I'm trying to perform the calculations for two wagers, but I'm a bit confused when this goes to 3 or higher.
To me it seems like what I really need is to understand how you're passing the sets to the recursive calls. From your parlay examples it seems like you change the set for different calls?
I also tried to use the non-recursive approach (assuming it would be easier to implement) but the abuse of notation did put me for a loop.
Thanks!