Dicey Games: Randomness & Strategy

• Dicey games are competitive scenarios with inherent randomness, where dice rolls shape strategies and outcomes.
• They utilize formal metrics like span, entropy, and outlier proportion to quantitatively assess randomness and game dynamics.
• Research in dicey games uncovers nontransitive relations, phase transitions, and computational challenges in strategic decision-making.

A dicey game is any structured competitive or cooperative scenario in which randomization—most canonically via dice—directly influences strategy, outcome, or both. The term “dicey games” also refers to the formal models where shared or structured randomness, intransitive relations, transient dominance, and complex stochastic mechanisms yield behaviors such as cycles, paradoxes, phase transitions, and computational hardness. Recent literature treats dicey games through the lenses of probability theory, combinatorics, distributed systems, and algorithmic game theory, highlighting the subtle interplay between stochasticity, coordination, and skill.

1. Metrics and Formalisms for Randomness in Dicey Games

The quantitative assessment of randomness in dice-driven tabletop games is rigorously operationalized by evaluating how outcome distributions vary under controlled “seeded” stochasticity. Let $G_s$ be the deterministic game tree produced by fixing the sequence of all random events (the “game seed” $s$), such as dice rolls or shuffles. Play $N$ independent matches on $G_s$ with two identically configured MCTS agents and record the first-player win-rate $p_s \in [0,1]$. For a collection of seeds $S$, the distribution $\{p_s : s \in S\}$ admits the following diagnostics:

• Span: $\mathrm{Span} = \max_s p_s - \min_s p_s$, measuring maximal outcome range across random event choices.
• Trimmed Span: Computed after discarding $\alpha$-percentile outliers to mitigate rare-seed effects.
• Entropy: Discretize $p_s$ into $s$0 bins, compute $s$1 as fraction in bin $s$2, then $s$3.
• Outlier Proportion: Fraction of $s$4 outside the 99% theoretical binomial CI for $s$5.

For random variable $s$6 denoting first-player win per match, $s$7, so

$s$8

However, over random $s$9, $N$0 is Bernoulli$N$1, justifying classical binomial CIs for aggregate win-rates. Mirrored-seed pairing (role-swapping) reduces variance, particularly when $N$2.

Empirical studies (e.g., Can’t Stop: Span $N$3, Outliers $N$4; Catan: Span $N$5, Outliers $N$6) demonstrate significant seed-dependent variability (Goodman et al., 4 Mar 2025). Decomposing Catan’s randomness using sub-seeds reveals the board setup (hex layout) is a more dominant randomness source than dice rolls.

As agent skill (measured by MCTS budget) increases, the span and the variance of outcomes also increase, as agents better exploit or suffer random state configurations. Designer-facing “randomness scores” can be formulated as:

$N$7

with task-specific weights (Goodman et al., 4 Mar 2025).

2. Intransitive (“Sucker’s”) Dice and Cycles

A “sucker’s bet” is a nontransitive system: a set of $N$8 dice or decks, each fair but with nonstandard face-labels, such that $N$9 for each $G_s$0 in a directed cycle. Classical examples, such as Efron’s four dice,

$G_s$1

exhibit pairwise win-probabilities of $G_s$2 in cyclic order: $G_s$3 (Ekhad et al., 2017). The essential metric is the pairwise winning probability:

$G_s$4

Enumeration of $G_s$5-deck systems with given sizes uses multivariate generating functions and recurrence relations, efficiently counting all nontransitive tuples for moderate parameters (e.g., five nontransitive three-deck systems with three cards each). Asymptotic frequencies for random triples remain on the order of $G_s$6. The existence of such cycles implies that the “is more likely to win” relation is not transitive; designers or casino operators can exploit this by always responding to a selection with a counter-die guaranteed (in expectation) to beat the player’s choice.

Markov models for board games such as Snakes and Ladders similarly reveal intransitive cycles among initial board positions: e.g., square 69 beats 79, 79 beats 73, and 73 beats 69, with strictly positive pairwise “edge” probabilities (Sorkin, 2022).

3. Paradoxical and Anti-Inductive Dice Phenomena

Dicey games can exhibit anti-inductive phenomena: given dice $G_s$7 and $G_s$8, and $G_s$9 rolls per player, the dominance relation $p_s \in [0,1]$0 (i.e., $p_s \in [0,1]$1) can invert as $p_s \in [0,1]$2 increases. For example, for $p_s \in [0,1]$3, $p_s \in [0,1]$4, $p_s \in [0,1]$5, but $p_s \in [0,1]$6—winning only at $p_s \in [0,1]$7 before reverting (Eldridge et al., 20 Mar 2025).

Families parameterized by face values (e.g., 3- or 4-sided dice) display complex “tongues” or fractal-like dominance regions in parameter space as $p_s \in [0,1]$8 varies. The limiting sign is eventually determined by normalized skewness, but the threshold $p_s \in [0,1]$9 before no further reversals is often astronomically large. Enumeration over parameter space reveals rich transient structure, with tight reversals tightly linked to combinatorial properties of the face-value multiset.

4. Dicey Games with Structured Shared Randomness

“Dicey Games,” in the formal sense, are zero-sum team games where shared sources of randomness—represented as a hypergraph $S$0 over team members $S$1—determine the information structure for strategies (Brice et al., 26 Jan 2026). Each hyperedge $S$2 corresponds to a “die” shared among its members. Individual strategies map observed dice to actions ($S$3).

• Strategy value: For the Boolean win/loss function $S$4, the team maximizes $S$5.
• Key examples: With independent dice, the win rate is $S$6 for $S$7 players; with a fully shared die, $S$8 is achievable. Pairwise-only sharing on cycles (e.g., triangular) yields intermediate achievable rates ($S$9 for $\{p_s : s \in S\}$0).
• Main theorems: All optimal strategies can be represented as “grid” strategies with at most $\{p_s : s \in S\}$1 partitions per die (where the adversary has $\{p_s : s \in S\}$2 pure actions). The decision problems (e.g., can the team achieve value $\{p_s : s \in S\}$3?) are computationally hard, lying in EXPSPACE and being NEXP-hard; however, structure (e.g., fixed maximal dice per player) lowers complexity.

Allocation of limited shared dice is itself hard: the allocation-threshold problem lies in EXPSPACE, while coverage-type payoff functions permit constant-factor approximations. The existence of cycles in the sharing hypergraph is required for nontrivial gains over factorized independent randomization (Brice et al., 26 Jan 2026).

5. Outcomes, Skill, and Phase Transitions in Dice-Driven Systems

In paradigmatic games such as RISK, dice outcomes drive high-dimensional state transitions. The single-engagement probabilities (e.g., attacker vs defender dice using order statistics and tie-break rules) can be exactly computed:

• For ordinary RISK ($\{p_s : s \in S\}$4 attacker dice vs $\{p_s : s \in S\}$5 defender dice, 6-sided): probabilities for defender losing two armies $\{p_s : s \in S\}$6, each losing one $\{p_s : s \in S\}$7, attacker loses two $\{p_s : s \in S\}$8 (Hendel et al., 2015).

These exact per-engagement odds, combined via negative-binomial or multinomial models, yield closed-form conquer probabilities over multiple battles. For large-scale engagements, normal approximations apply: the probability of attacker success is sharply concentrated around the “$\{p_s : s \in S\}$9+$\mathrm{Span} = \max_s p_s - \min_s p_s$0” rule—i.e., attackers need at least $\mathrm{Span} = \max_s p_s - \min_s p_s$1 times the number of defender armies, plus two, to cross the $\mathrm{Span} = \max_s p_s - \min_s p_s$2 win-probability threshold. The phase transition in win-probability occurs within $\mathrm{Span} = \max_s p_s - \min_s p_s$3 of this critical point.

Skill interacts with randomness: increased agent search budget amplifies the dependency on seed configurations, with Span and other randomness metrics rising as stronger players more adroitly exploit favorable states (Goodman et al., 4 Mar 2025). A small number of configurations exhibit non-monotonic skill dependence (“k-level traps”).

6. Threshold and Phase-Transition Gambles: Risk, Greed, and Path-Dependence

Repeated multiplicative gambles—typified by games in which a stake is repeatedly multiplied by “up” ($\mathrm{Span} = \max_s p_s - \min_s p_s$4) or “down” ($\mathrm{Span} = \max_s p_s - \min_s p_s$5) factors per round—demonstrate a nontrivial separation between arithmetic expectations and typical outcomes (Göll et al., 2021). For capped systems (maximum payout), the probability of finishing with a profit approaches zero as the number of rounds $\mathrm{Span} = \max_s p_s - \min_s p_s$6 increases unless $\mathrm{Span} = \max_s p_s - \min_s p_s$7 ($\mathrm{Span} = \max_s p_s - \min_s p_s$8 is success probability). At a critical threshold ($\mathrm{Span} = \max_s p_s - \min_s p_s$9 for unbiased coins), the expected profit transitions sharply between “profit” and “ruin” zones. In the uncapped setting, the fair frontier is $\alpha$0.

This leads to practical misperceptions in dicey gambling: positive mean outcome per round (arithmetic average) does not ensure typical net winnings due to pathwise multiplicative effects, non-ergodicity, and rare-event dominance in final distributions. The mathematical model and Python algorithms confirm abrupt phase-switching and show that most participants lose, even when naive expectations are positive (Göll et al., 2021).

7. Broader Implications and Open Directions

Dicey games highlight the diversity of behaviors arising from simple stochastic primitives. They reveal:

• Structural nontransitivity, both in devices (dice, cards) and in state-space transitions (e.g., Markovian board games).
• Subtle dependency on the architecture of shared randomness in multi-agent distributed systems, with computational tractability and optimality contingent on hypergraph cycles and die allocation (Brice et al., 26 Jan 2026).
• Fragility of intuition in multi-stage or multiplicative games, where geometric means and rare-event statistics override arithmetic expectations.

Analysis and formal modeling of dicey games extends to algorithmic game theory, stochastic optimization, and the design of robust, fair, or intentionally paradoxical competitive systems. Further research directions include tightening upper/lower bounds for value computation in the presence of limited shared random sources, dynamic dicey game extensions, and exploration of multi-valued action sets. These investigations illuminate fundamental principles of randomness, coordination, and paradox in interactive systems driven by dice and analogous stochastic mechanisms.

---

References: (Goodman et al., 4 Mar 2025, Ekhad et al., 2017, Eldridge et al., 20 Mar 2025, Hendel et al., 2015, Göll et al., 2021, Brice et al., 26 Jan 2026, Sorkin, 2022).