Markov Chains

цепи маркова

The Markov Chain module implements a simple algorithm, discovered by Andrey Markov in 1906, and adapted for the analysis of lotteries.

I won’t go into the principles (anyone can read Wikipedia), I’ll just describe the rules of work with the program:

1) After opening the database in the module interface, the fields for the initial (From Draw) and final draws (To Draw) for analysis are automatically filled in, and the draw (Input Draw), which will be fed to the input of the calculated chain to generate a forecast.
2) Description of checkboxes and input fields:

  • Count – the number of generated variants in the forecast
  • Sort – sort output numbers ascending
  • Only Regular Balls – analyze and predict only regular numbers (additional and bonus are not taken into account, even if available)
  • Check With Next Draw – check the predicted variants with a draw following the “Input Draw”
  • Short out – in case of verification, display brief information on matches and wins (similar to other modules)
  • Most probably – only the most likely. If this flag is not checked, then each variant is formed randomly from pairs of numbers depending on their probabilities. Each time you press the Predict button, different variants will be printed. If checked, then the variants will be formed from the most likely pairs, as a result of which they will always be the same for the selected range of draws (no matter how many times you click “Analize” and “Predict”)

3) Then click the “Analize” button, some statistical information will be displayed. The forecast itself is carried out by pressing the “Predict” button.

Good luck in predicting the results of subsequent lottery draws!

P.S. Attentive readers may be puzzled by the “success” of the forecast in the screenshot above. No, I did not draw it in Photoshop. This is the real work of the program, however, there is one trick that allowed me to demonstrate what the verification of variants for winning looks like.

Leave a Reply