Calculate Probability of Winning w/ Advantage & Bankroll

  • Thread starter Thread starter 111111
  • Start date Start date
111111
Messages
29
Reaction score
0
Say you are playing game in which you are betting money and you believe you have an advantage, (if you bet $X and win, you get $2X back). Given a bankroll X an bet unit of Y and an advantage of A, what is the probability of at some point having MX dollars, assuming you play until you either run out of money or you reach your target?

I have made simulations on excel and have found that it is easy to calculate when you have zero advantage (i.e. the probability of winning is 50%) because regardless of your bet size you always have a X/MX probability of reaching your target (MX).

Example: you have $1,000 and will play a fair game until either you reach $2,000 or zero, the odds of doing this is 50% regardless of bet size.

So given all of this I am wondering what the probability will be when you change one factor (the advantage).

According to my simulation If you have $600 and bet $10 at a time you have about a 90.28% chance of reaching $1200 before you reach zero, if your chance of winning is 51%. I say "about" 90.28 because I have only run it a couple thousand times and it is constantly changing. Since I'm doing it on excel it takes a couple minutes to rack up a thousand runs.

I would like a way to calculate it exactly, but if anyone knows of some good simulation software that will do this, I would appreciate it if you told me.
 
Last edited:
Physics news on Phys.org
You can do this by conditional probability

P(winning|starting position) = P(winning|lose first)P(lose) + P(winning|win first)P(win first)

So if the probability of winning is p, you call the probability of winning from position k pk and get

pk = pk-1(1-p) + pk+1p

which I'm fairly certain is solvable if you know how to do that sort of thing. You can get your boundary conditions by noting you always win if you start with the money you're trying to get, and always lose if you start with 0 dollars

Note that in your simulation, you'd probably want to scale everything down by a factor of 10 (so you start at position 60, and win or lose 1 dollar each round)
 
See http://freestatistics.altervista.org/en/stat.php,

"STATISTICAL LAB (3.5): interactive Tool To Simulate and Solve Statistical Problems (you need to have R installed)."

Alternatively you can try programming it in C++ or Fortran, if you have a compiler -- these will run extremely fast.
 
Last edited:
Office_Shredder said:
So if the probability of winning is p, you call the probability of winning from position k pk and get

pk = pk-1(1-p) + pk+1p

I'm not sure if that will work for what I am talking about, maybe if you give a demonstration.

But anyways, shortly after posting this thread I figured out an easy way to do it by using geometric series.
 
Last edited:
What Office_Shredder indicated is the general method of solving these type of problems,
known as difference equations, here which is of second order. No simulation is required.
 
Last edited:
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top