Lottery Combo Question

Reply #34

lottoarchitect — Thu, 27 Nov 2003 13:30:28 GMT

Lets explain t

Reply #33

lottoarchitect — Thu, 20 Nov 2003 11:54:22 GMT

Maybe the above code its ve

Reply #32

lottoarchitect — Tue, 18 Nov 2003 17:18:10 GMT

ok boys, here is the a

Reply #31

JADELottery — Tue, 18 Nov 2003 03:02:45 GMT

Well, it's been a month and 2 weeks; no responses. I guess no one found the code useful or has been able to adapt it to other programming languages. Oh-well, was worth a try.

Reply #30

JADELottery — Fri, 17 Oct 2003 10:51:39 GMT

Has anyone had success using or adapting the VB algorithm? It's been almost 2 weeks since the release of the algorithm.

Reply #29

WILLSELL — Thu, 09 Oct 2003 21:21:10 GMT

why are you concerned with cpu cycles? You spent all that money on the latest cpu and unless you are doing something like you are trying to do you will only consume on average 2-5% of cpu. So let it rip and see how long it taqkles to produce result.I have done something similar and it takes about 10 minutes to go through several million iterations. I have also tried using MSAcess and the results are fast.You are doing a form of data mining ...to yield some insight ..to hell with cpu time.......g... [ More ]

Reply #28

JADELottery — Thu, 09 Oct 2003 12:35:12 GMT

There has been some questions about the recursive calling factorial function.Here is a possible solution to the factorial function:Function Fact(N) As Double 'The factorial function, Fact(N) = N! = N * (N-1) * (N-2) * (N-3) * ... * 3 * 2 * 1If (N < 1) ThenFact = 1 Else F = 1For a = 1 To NF = F * aNext aFact = FEnd If End Function

Reply #27

Todd — Sat, 04 Oct 2003 23:00:02 GMT

By the way, those are some nice functions you posted. I'm a huge fan of recursion - I think you can generate some of the most elegant coding through recursion. Thanks for posting.

Reply #26

Todd — Sat, 04 Oct 2003 22:56:44 GMT

Quote: O

Reply #25

JADELottery — Sat, 04 Oct 2003 22:50:44 GMT

Actually, I've always been here... I like to watch and learn... plus, working on my home and working in general is taking up most of my time.

Reply #24

Todd — Sat, 04 Oct 2003 22:44:43 GMT

Jade,Wow, it's bee

Reply #23

JADELottery — Sat, 04 Oct 2003 22:34:59 GMT

Thank you. It would be interesting to see what the VC translation would be. VB is my native language. I've done a little study in C, but never really got the hang of it.

Reply #22

Bug — Sat, 04 Oct 2003 18:23:18 GMT

Nice work

Reply #21

JADELottery — Sat, 04 Oct 2003 18:10:31 GMT

Here's the Visual Basic algorithm I've come up with for finding the combinatorial index of a combination for N items taken R at a time. Those of you who know VB, know what to do. Those of you who know another programming language and VB should know what to do. Global Counter(1 To R) As Integer 'R must be assigned some value before program run.'The program can handle anything R or less when' when assigned.'note: This global array must be put in the declarations part of the function module or'so... [ More ]

Reply #20

MrSteel01 — Sun, 28 Sep 2003 20:10:00 GMT

KY C/5Fri Sep 26 '03 7 - 12 - 13 - 32 - Cashball: 3Thu Sep 25 '03 8 - 12 - 25 - 30 - Cashball: 7Fri Sep 26 '03 7 - 12 - 13 - 32 - Cashball: 3Thu Sep 25 '03 8 - 12 - 25 - 30 - Cashball: 7Wed Sep 24 '03 2 - 24 - 26 - 27 - Cashball: 5Tue Sep 23 '03 2 - 8 - 14 - 32 - Cashball: 19Mon Sep 22 '03 10 - 14 - 17 - 26 - Cashball: 24Sat Sep 20 '03 13 - 15 - 17 - 30 - Cashball: 25Fri Sep 19 '03 6 - 15 - 21 - 32 - Cashball: 31Thu Sep 18 '03 3 - 4 - 9 - 32 - Cashball: 26Wed Sep 17 '03 6 - 7 - 10 - 22 - Cashbal... [ More ]

Reply #19

MrSteel01 — Sun, 28 Sep 2003 15:49:54 GMT

Quote: Originally posted by hypersoniq on September 26, 2003 you can watch all the PB drawings on their site, but you don't need to because if you click here you can see the history in draw order (plain text, perfect for importing into excel or access or SQL etc...)and true, the balls ARE EXACTLY the same size and weight, they also have no idea what number they have on them... think of it as a NASCAR race.... what good is it really if you sorted the top 5 finishers, it may or may not tell what t... [ More ]

Reply #18

MrSteel01 — Sun, 28 Sep 2003 15:34:37 GMT

If that's the case it should be even quite easy with your set up!4 balls have some sort of repeating occurance pb balls have to have some sort of reapeating occurance too! Keep them seperate

Reply #17

Littleoldlady — Sat, 27 Sep 2003 12:34:59 GMT

I have been tracking our Cash 5 in Ky and the number trends are for repeats..within every 12 draws, there is 1 or 2 draws that will repeat previously draw numbers for all 5 numbers. The actual average for this to appear seems to be between the 6th through the 9th draw. I don't have my PB stats caught up but I would think there was a similar relationship. There are also trends of hot numbers that change from week to week. I also put the numbers in groups of hot, warm and cold (I set my o... [ More ]

Reply #16

hypersoniq — Fri, 26 Sep 2003 23:55:47 GMT

also, no number has appeared in sorted position more than 11 times... the SORTING colors the results.the above frequency list is also counting how many times each has appeared as the PB, I couldn't post the whole chart, too big...

Reply #15

hypersoniq — Fri, 26 Sep 2003 23:54:35 GMT

Quote: Originally posted by MrSteel01 on September 26, 2003 ALL THE NUMBERS add up to 160!No matter how they came out!Now what? Should we video all draws to see how they were drawn? The numbers are on two sides equal in size shape and weight the same in grams! +-!you can watch all the PB drawings on their site, but you don't need to because if you click here you can see the history in draw order (plain text, perfect for importing into excel or access or SQL etc...)and true, the balls ARE EXA... [ More ]

Reply #14

MrSteel01 — Fri, 26 Sep 2003 22:48:31 GMT

ALL THE NUMBERS add up to 160!No matter how they came out!Now what? Should we video all draws to see how they were drawn? The numbers are on two sides equal in size shape and weight the same in grams

Reply #13

MrSteel01 — Fri, 26 Sep 2003 21:58:56 GMT

Quote: Originally posted by Bug on September 26, 2003 You would not write the code like that if you wanted to include duplicates! The abstraction though seems to be to difficult for you to understand. Repeating sets puts you around 7 million numbers. Your solution for what is your problem, and not Chets if I understand him correctly, is amateurish.It seems to me that anyone who would look at this in a normal matter and they doe not need to be a rocket scientist! Why would you look at numbers,

Reply #12

hypersoniq — Fri, 26 Sep 2003 20:36:58 GMT

the problem with sums are that they are too generic... not easy to decode a sum into a set of 5 or 6 numbers...and while most lottery databases only provide draw history in sequential order, draw history is more accurate because a sorted number could have been drawn several different ways. sorting is a process added AFTER the drawing and it should be remembered that it was done to make the numbers easier to read, it's not a true indication of what happened during the draw...1-22-40-48-49 sorted... [ More ]

Reply #11

Bug — Fri, 26 Sep 2003 19:20:19 GMT

You would not write the code like that if you wanted to include duplicates! The abstraction though seems to be to difficult for you to understand. Repeating sets puts you around 7 million numbers. Your solution for what is your problem, and not Chets if I understand him correctly, is amateurish.

Reply #10

MrSteel01 — Fri, 26 Sep 2003 14:05:17 GMT

Quote: Originally posted by Bug on September 26, 2003 Remember to stick below code in all but the last for loops if != slot[] to result[] continue;in your loops. This will insure that you omit many useless comparisons by incrementing the current slot before comparing the second, third, etc., slot. I may be explaining the obvious, but I am not sure. I think that this would cut each result comparison down to a maximum of 43 + 44

Reply #9

Bug — Fri, 26 Sep 2003 08:33:40 GMT

Remember to stick below code in all but the last for loops if != slot[] to result[] continue;in your loops. This will insure that you omit many useless comparisons by incrementing the current slot before comparing the second, third, etc., slot. I may be explaining the obvious, but I am not sure. I think that this would cut each result comparison down to a maximum of 43 + 44 + 45 +46 + 47 or 225, instead of all multiples combos.

Reply #8

Bug — Fri, 26 Sep 2003 08:18:22 GMT

The loop numbers should start a = 1; a < 44; then b = a +1; b < 45. and so on. This gets you a list without duplicates. Sorry it was early when I first posted.

Reply #7

MrSteel01 — Fri, 26 Sep 2003 08:18:22 GMT

Quote: Originally posted by Cheters on September 26, 2003 ChetI guess if you index them as you say you numbered them from #! to #435,000 right!Then highlight the ones that came in after you find the low/high sums to help you determine the numbers you want to play don't for get reapeading sets!E-mailed my dos program!Good luck worked on this for a while w/BRAD

Reply #6

MrSteel01 — Fri, 26 Sep 2003 07:41:54 GMT

ChetWhat are you going to do use all the wood in Muier Nat Park!If you had a program for reapeatting sets you would have many 5 out 6 groups but not a winner! To many combos 6 digits will never reapeate in the end

Reply #5

MrSteel01 — Fri, 26 Sep 2003 07:23:33 GMT

Quote: Originally posted by RJOh on September 25, 2003 At www.saliu.com/infodown.html there is a program NthIndex.EXE. that find the index of a lotto combination and vice-versa. For example the combination 5 10 15 20 25 is index no. 611,893 in those 1533939 combinations.Hope this is what you're looking for. Good luck to you.RJOh Simple is not easy for you all to comprehend! Their willNEVER be time for all those combinations to fall or even part or asyou or anyone would believe! Sums... [ More ]

Reply #4

Bug — Fri, 26 Sep 2003 05:41:25 GMT

It isn't much CPU time 30 sec. to 1.5 mins tops. Use the index of array[] as your guide to the combo number, Good Luck. edit e < 47

Reply #3

Bug — Fri, 26 Sep 2003 05:29:00 GMT

here is some pseudo codefor loop int a = 0; a < 42; a++first slot[0] = a;for loop int b = a +1; b < 43; b++second slot[1] = b;for loop c = b + 1; c < 44; c++ third slot[2] = c;and so forth to e < 45 . int Slot[] can be pushed on a array[] and then the the comparison in some more loops with your drawn numbers. It is difficult if you don't have some programming experience, but not to hard if you have some.

Reply #2

Cheters — Fri, 26 Sep 2003 02:37:53 GMT

Yeah the program works, but i am trying to find an equation that does pretty much one thing. The code this program loops through the combos one by one keeping a counter. I know how to do that. What i am trying to do is write some code that runs through all the numbers drawn so far in the lottery compute the corresponding combo #, and if it loops though a lot of combos trying to find it, that is a lot of wasted cpu time, and could take awhile to get all the combos for all that was drawn thus f... [ More ]

Reply #1

RJOh — Thu, 25 Sep 2003 21:58:10 GMT

At www.saliu.com/infodown.html there is a program NthIndex.EXE. that find the index of a lotto combination and vice-versa. For example the combination 5 10 15 20 25 is index no. 611,893 in those 1533939 combinations.Hope this is what you're looking for. Good luck to you.RJOh

Lottery Combo Question

Cheters — Thu, 25 Sep 2003 20:19:52 GMT

Does any one know an equation to solve what the combo is for like any number set, for a lotto system with 47 balls? For Example 1 2 3 4 5 = 1 combo, the number set 1 2 3 4 6 = 2 combo, 1 2 3 4 7 = 3 combo... 43 44 45 46 47 = 1,533,939. I know to figure out the combos for all the number for this is take (43*44*45*46*47)/5! = 1533939. Any help would be appreciated :)Chet