Calculate Probability of Winning w/ Advantage & Bankroll

  • Thread starter Thread starter 111111
  • Start date Start date
AI Thread Summary
The discussion focuses on calculating the probability of reaching a financial target in a betting game where the player has an advantage. Simulations indicate that with a bankroll of $600 and a bet of $10, the probability of reaching $1200 before going broke is approximately 90.28% when the winning chance is 51%. The conversation explores using conditional probability and difference equations to derive an exact calculation method. It also mentions alternative simulation software and programming languages for more efficient calculations. Ultimately, the author discovered a solution using geometric series, eliminating the need for simulations.
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:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top