Finding Blackjack's Optimal Strategy in Real-time and Player's Expected Win
| dc.creator | Solowiej, Jarek | |
| dc.date | 2004-12-15 | |
| dc.date.accessioned | 2026-07-07T05:15:20Z | |
| dc.date.available | 2026-07-07T05:15:20Z | |
| dc.description | We describe the probability theory behind a casino game, blackjack, and the procedure to compute the optimal strategy for a deck of arbitrary cards and player's expected win given that he follows the optimal strategy. The exact blackjack probabilities are used, in contrast to approximate probabilities used by Baldwin et al. \cite{BCMM} or Monte Carlo methods. We distinguish between two probability measures $\mathbb{P}$ and $\mathbb{Q}$; $\mathbb{P}$ is used to compute dealer's probabilities and $\mathbb{Q}$ is used to compute player's expectations. The implementation is described in pseudo-C++. The program is fast enough to deal with any blackjack's hand in a matter of seconds. | |
| dc.identifier | https://arxiv.org/abs/math/0412311 | |
| dc.identifier | http://arxiv.org/abs/math/0412311 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/73596 | |
| dc.subject | Optimization and Control | |
| dc.title | Finding Blackjack's Optimal Strategy in Real-time and Player's Expected Win | |
| dc.type | text |