SearcharxivSearch

arXiv · 1906.01220

Snackjack: A toy model of blackjack

Abstract

Snackjack is a highly simplified version of blackjack that was proposed by Ethier (2010) and given its name by Epstein (2013). The eight-card deck comprises two aces, two deuces, and four treys, with aces having value either 1 or 4, and deuces and treys having values 2 and 3, respectively. The target total is 7 (vs. 21 in blackjack), and ace-trey is a natural. The dealer stands on 6 and 7, including soft totals, and otherwise hits. The player can stand, hit, double, or split, but split pairs receive only one card per paircard (like split aces in blackjack), and there is no insurance. We analyze the game, both single and multiple deck, deriving basic strategy and one-parameter card-counting systems. Unlike in blackjack, these derivations can be done by hand, though it may nevertheless be easier and more reliable to use a computer. More importantly, the simplicity of snackjack allows us to do computations that would be prohibitively time-consuming at blackjack. We can thereby enhance our understanding of blackjack by thoroughly exploring snackjack.

Explore related subjects

Keep this discovery

BibTeXRIS

Stewart N. Ethier, Jiyeon Lee. 2019-06-04. Snackjack: A toy model of blackjack. https://arxiv.org/abs/1906.01220

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR