SearcharxivSearch

arXiv · 1406.0351

Zombie Dice: An Optimal Play Strategy

Abstract

We discuss the game of Zombie Dice, published by Steve Jackson Games. This game includes green, yellow, and red dice. Each die has brain, footprint, and shotgun symbols on it, with each color of dice having a different amount of each symbol. Out of the dice, three are randomly picked and rolled. The player plays as if he were the zombie, meaning that brains are wanted and shotguns are not. Footprints are rerolled if the player chooses to keep going and not score. One brain equals one point. If three shotguns are accumulated, then that player's turn is over and he loses all his brains for no points (busting). The objective of the game is to gain thirteen or more points. In this article, we investigate a model for deciding whether or not to continue rolling (if given the opportunity). With this model, we create a decision point given information about the current player's turn including the amount and color of dice left in the cup, color and number of footprints, and the current number of shotguns of the player. Examples will be shown to highlight the game and its strategy fashioned from the model.

Explore related subjects

Keep this discovery

BibTeXRIS

Heather L. Cook, David G. Taylor. 2014-06-02. Zombie Dice: An Optimal Play Strategy. https://arxiv.org/abs/1406.0351

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