the next state depends only on the current state and not on the sequence of events that preceded this particular type of "memorylessness." is called the Markov property. "In lottery, I would say that this means that the numbers in the current draw only depend on the numbers before the draw. For example, if the number in the first position (lowest) is a" 3 "the number drawn in the position where the draw following is only dependent on the fact that it was preceded by a 3. I developed a spreadsheet that account that numbers follow other numbers. if the 3 in the first position, 44% of the time the next number will be 1-4, especially 2 4 and 14% each. more generally, if a 3 is drawn in the lower position, approximately 10% of the time the other 3 will be drawn to about 70% of the time a number greater than 3 will be drawn .Using this method can usually get correct numbers of 2, which is not bright! using 5 groups (e.g., 1-4, 5-9, 10-14, etc.) can sometimes give 4 or 5 correct, but it gives a lot of numbers to play. If you have any idea how to tune this methodology I would be happy to hear them.
As one might use a macro,. I consider the position of a ball (after separation) as an accident dependent on other balls extracted with him. So I asked the question "which followed balls number N in the next draw, regardless of position." For a ball 6 draw that generates 6 balls for each ball time N appears. If the ball was designed N 200 times, then 1,200 balls followed him about the history of the lottery. Within this statistic is an ordered list containing that ball (s) followed the most. For a lottery with more than a thousand draws, I asked myself how much I really need to look back in history, so my current configuration only look back on the most recent 500 draws. My lottery is 49/6. The macro needs to see
Position by position, and with neighboring position is possivek use Markov chains? Or have another solution? thank you