Well, I was thinking if it would possible to somehow exploit the relation between the order of numbers on the wheel and even chances they belong to. Just a quick brainstorming in source code written into comments.

I'm thinking about exploiting "balance theory", which I don't know if it could be considered at least correct. I suppose, that on average, the hits on sectors of wheel should be balanced, and only sometimes there would be a dispersion of hits skewing hits into one side.

If you write for each number to what EC it belongs to, and also count distances between each two numbers in the same group, you find out, that there are groups, whose numbers are more evenly distributed on the wheel and groups whose numbers are not. Half of the wheel has nicely balanced groups and the other does not.


   // single zero wheel
   static const int wheel[]  =
  {0,32,15,19,4,21,2,25,17,34,6,27,13,36,11,30,8,23,10,5,24,16,33,1,20,14,31,9,22,18,29,7,28,12,35,3,26};
// 0, H, L, H,L, H,L, H, L, H,L, H, L, H, L, H,L, H, L,L, H, L, H,L, H, L, H,L, H, L, H,L, H, L, H,L,H
// 0, E, O, O,E, O,E, O, O, E,E, O, O, E, O, E,E, O, E,O, E, E, O,O, E, E, O,O, E, E, O,O, E, E, O,O,E
// 0, R, B, R,B, R,B, R, B, R,B, R, B, R, B, R,B, R, B,R, B, R, B,R, B, R, B,R, B, R, B,R, B, R, B,R,B


// 0:                                          | 1x |

// H-E-R: 32 -d8- 34 -d4- 36 -d2- 30           | 4x | md: 14 ---
// L-O-B: 15 -d6- 17 -d4- 13 -d2- 11           | 4x | md: 12    \
//                                                               -- 32 to 10 - half of a wheel
// H-O-R: 19 -d2- 21 -d2- 25 -d4- 27 -d6- 23   | 5x | md: 14    /
// L-E-B:  4 -d2-  2 -d4-  6 -d6-  8 -d2- 10   | 5x | md: 14 --
//
// L-O-R:  5 -d4-  1 -d4-  9 -d4- 7  -d4- 3    | 5x | md: 16 ---
// H-E-B: 24 -d4- 20 -d4- 22 -d4- 28 -d4- 26   | 5x | md: 16    \
//                                                               -- 5 to 35 - half of a wheel
// L-E-R: 16 -d4- 14 -d4- 18 -d4- 12           | 4x | md: 12    /
// H-O-B: 33 -d4- 31 -d4- 29 -d4- 35           | 4x | md: 12 ---


In this for example  H-E-R: 32 -d8- 34 means that between numbers 32 and 34, which are both high, even, red is distance 8 on the wheel, you got to make 8 steps to the right to reach another number in that group. You see that in some groups the distances are same, and in some are not.

Now I'm thinking, if this could be used to create bet selection, which would for some time had a little "advantage" because the sectors on the wheel would be hitting normally distributed, and only from time to time it would made a quick fall because of dispersion of hits the ball would be hitting more one part of the wheel.

Have anyone some idea if this could be exploited somehow? Either to bet on "balanced" groups, or wait for some signal and start to flat bet on unbalanced ones? And is there actually MORE BALANCE or is it ALWAYS SKEWED ino some side in short term? I have never been thinking about such a think...

Simple experiment - after a six spins switch playing L-E-R and H-O-B. Zero roulette, and there is what I want - some "flat" runs with quick "downfalls" from time to time, sometimes too often though. But at least it seems that it CAN be done with bet selection to have a nice flat or lightly winning run. Now how to enforce as long runs as possible?

The thing above was an error, I have forgotten to enable virtual mode, so the above result is combination of all chances above + L-E-R & H-O-B played with two units instead of one alternately. Removing that, the graph is not as "consistent", but losing is much slower, so it has to be investigated what happened.