Minimizer

[zz]

Hi Stan

How fast the optomizer and minimizer should be using an average RAM and processor ? Have you any opinions regarding different numbers of lines and what is the maximum number of lines is possible to deal with? I tried it but it seems something pretty slowing it at my computer. For a thousand lines it seems it even won't start...

[stan]

the available memory is not that important. once the minimizer starts calculating then it means you have enough memory. having more memory won't make the algorithm faster.

the most significant factor is the number range.
i have an old pentium III 850MHz laptop with 512MB of ram.

it took me 153 seconds to apply minimizer on all combinations of 15 numbers for 3if6 guarantee. but it takes 412 seconds for 3if6 for 16 numbers and 1321 second for 3if6 for 17 numbers. so you can do the math...

i'm sorry but that's about as fast as it gets. maybe i'll manage to optimize the algorithm a bit but there's just too many combinations to iterate through.

btw, the progress bar is not that accurate. e.g. when minimizing for 3if6 from 17 numbers the progress bar shows 12376 steps to be calculated which would seem to take forever judging by the time needed for one step only. but the progress bar actually stops after 6 steps only when the required guarantee has been reached.

[zz]

That is OK for the people who look for wheels using a group of numbers. How about optimizing or minimizing a certain number of lines where numbers are all in range 1-49? You just have a page with some number of lines containing numbers 1-49 and would like to minimize or optimize it .In your opinion what is the MAX number of lines can be optimized or minimized in some reasonable time - let's say in about an hour or so?

The lines were for example

3,5,40,44,48,49
39,40,43,44,49
.
.
.
.
3,4,40,43,44,49

and how many you may input expecting any results in some reasonable time, up to several hours?

[stan]

it's same story with random tickets. here are my results for random tickets from 49 while minimizing for 3if6 guarantee:

3 tickets - 19 seconds
6 tickets - 48 seconds
10 tickets - 135 seconds
20 tickets - 400 seconds

when playing a 6/49 lottery and the package contains N tickets then the minimizer must do "N x 14mills" iterations to find one matching ticket.

for example if the nature of tickets in the package is such that only half of them are needed for the required guarantee then the minimizer must do "N/2 x N x 14mills" iterations.

[zz]

So, probably it may optimize several hundreds of tickets in some reasonable time, which is quite Ok. BTW, didn't know it may make wheels. However, thanks Stan.