Big Six · Money Wheel · simulation

Brute-forcing the Big Six wheel

After a trip to Vegas (and losing a bit of money at the Big Six wheel), I wrote a C++ program that played every betting combination, starting each one with $1,000. This is that program rebuilt for the browser, as a tournament: every strategy plays the same spins, the worst half gets knocked out each round, and play continues until one champion is left.

Then the page checks whether the champion actually found anything. (Spoiler: the house always has the edge. The fun part is watching luck pretend otherwise.)

The wheel

House edge is the share of every bet the casino keeps on average. Even the best spot on the wheel costs you about $11 for every $100 you bet.

The tournament

Run it again (and again)

If one combination really were the best, it would win most tournaments. Play complete tournaments with new spins each time and count who wins.

Why no combination can win

Every spot has its own house edge: the chance of winning times what it pays, minus one. On the $1 bill, 24 of 54 stops pay 1 to 1, so a $1 bet comes back as $2 with probability 24/54. On average that's $0.89, an 11.1% loss.

A combination is just several of those bets at once, and averages add up. The house edge of a combination is the average of its spots' house edges, weighted by how much is on each. An average can never be lower than its lowest part, so no mix beats the best single spot, and the best single spot still loses.

Spreading bets out does change the swing: how far one night can wander from that average. Big swings are what win short tournaments, which is why the champion is usually a bet that swings a lot or bets small, not one with a better edge.