Subj : Re: efficient way of processing m combinations of n numbers in p sets
To   : comp.programming
From : CBFalconer
Date : Thu Aug 18 2005 01:52 am

Willem wrote:
> 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.
> 
> 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 ?

Please fix your unconventional quote marker, which causes problems
for some peoples newsreaders.

-- 
"If you want to post a followup via groups.google.com, don't use
 the broken "Reply" link at the bottom of the article.  Click on 
 "show options" at the top of the article, then click on the 
 "Reply" at the bottom of the article headers." - Keith Thompson

.