Subj : Re: efficient way of processing m combinations of n numbers in p sets
To   : comp.programming
From : Mike
Date : Wed Aug 17 2005 12:38 pm

Thanks for replying but it seems a little more complex than just
finding the combinations or permutations.  The possible number of
combinations is the number of increments made on each horse to the
power of the number of horses.

e.g. bet between 2 and 3 on 6 horses in 0.1 increments = 11 ^ 6 =
1,771,561 possibilities.

If it is actually as easy as you say I would be grateful if you could
explain how to compute this.

Mike - thanks for your mathematical explanation.  I can see a couple of
issues with it though which I believe Willem saw, in that 1) it always
uses the total amount you "could" bet with and 2) there is no minimum
restraint i.e of 2.

Willem - thanks for your continued input.

Mike

.