Inspired by the discussions around the 1 - 2 - 3 Labouchère, I developed
a step tree generator that can calculate the sequences for "non-linear" roulette strategies.
First of all, I was able to determine that the 1-2 Labby also contains the 1-2-3 Labby and many others
as a subset. It is therefore entirely sufficient to test the basic form 1-2 Labby in order to
draw conclusions about the overall concept.
Since the Labby always appends the sum of the first and last number in the event of a loss,
a new branch in the step tree emerges at almost every step - the resulting step tree is therefore very large.
The finite 1-2 Labby strategy discussed here spans 15 decision levels,
meaning that from step 1, 15 Labby steps follow before jumping back to step 1.
This requires 1,001 steps.
In the published 1 - 2 - 3 Labouchère, there are 5 levels with 26 steps.
1,001 Steps
The step tree with 1,001 steps as a scaled-down preview:
Click the image to open the original - but be warned, it is very large and may overwhelm your device! [354 KB]
Of course, the roulette strategy was also thoroughly tested in 300 standard tests:
The continuous strategy test over 1 million rounds also yielded the same result:
Return: -1.42% ⌀ -1.47%, Balance: -106,548, Turnover: 7,511,920, Bets: 1,000,000, Spins: 1,000,000
Unfortunately, this strategy is simply too extensive to publish here in the conventional way -
the risk of crashes on many computers and other devices such as smartphones or tablets is simply too great!
(... the simulator handled the scope without any issues)
Have fun with the 1-2 Labby strategy for roulette,
trizero
