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

Mike wrote:
) 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.

Are you getting anywhere with my last post ?  I.E. the one where I claim
that you can walk to the optimal solution by starting at 2,2,2,2,2,2 and
walking 'downhill' from there ?


SaSW, Willem
-- 
Disclaimer: I am in no way responsible for any of the statements
            made in the above text. For all I know I might be
            drugged or something..
            No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT

.