Problem Description: Two players, A and B, start with custom amounts of money that sum to N. Each round, player A has a probability p of stealing 1 dollar from player B, player B has a probability q of stealing 1 dollar from player A, and they have a probability 1-p-q of tying. The game continues until one player goes bankrupt.
Trials completed: 0 / 1,000
Total rounds simulated: 0
Probability of Player A winning: -
Probability of Player B winning: -
| Total Money (N) | Player A Start (i) | Player B Start (N-i) | Prob. A (p) | Prob. B (q) | Trials | Player A Win % | Player B Win % | Avg. Rounds |
|---|