Backgammon Mathematics: Probability, Pip Count & Equity

Why mathematics matters to a backgammon player

Backgammon is, formally, a two-player zero-sum stochastic game of perfect information with imperfect equity asymmetry under a tunable stakes lever. The unwieldy description matters because each clause corresponds to a distinct branch of the game's mathematics:

Two-player zero-sum. Standard game theory applies. There is always a well-defined optimal strategy for each player at every position. Equity is conserved across the two sides.
Stochastic. The 36 equally weighted outcomes of two six-sided dice introduce a probability distribution over moves. Most positions admit multiple legal plays per dice outcome.
Perfect information. The full board state is visible to both players. There are no hidden cards, no private values.
Imperfect equity asymmetry under a tunable stakes lever. The doubling cube turns every position into a no-limit equity decision, layering an entire second game-theoretic problem on top of the move-selection problem.

This page covers the mathematical apparatus competitive players use to handle that machinery: pip counts, race equity formulas, match equity tables, the Janowski cube formula, and the heuristic shortcuts (Neil's Numbers) that compress the formal backgammon mathematics into over-the-board mental calculations.

Sub-pages:

Match Equity Tables (MET) — the full Rockwell-Kazaross pre-Crawford MET, the Janowski formula, gammon prices, take-point calculation.
Neil's Numbers — the canonical mental heuristics for over-the-board MWC calculation.

Position Counts and State Space

The number of legal backgammon positions is on the order of $1.85 \times 10^{19}$ — calculable as the number of ways to distribute 30 checkers across the playable locations (24 points, 2 bear-off trays, 2 bar positions) subject to the 15-per-side constraint and the no-mixed-occupation constraint, with appropriate corrections for invalid overlapping configurations. This number is large enough that brute-force solution by table lookup is infeasible for the full game; it is small enough that race-only positions (those out of contact) admit complete bearoff databases.

Bearoff databases store exact equities for race-phase positions; GNU Backgammon generates and ships its own, and eXtreme Gammon has its own. They are built by dynamic programming over the recursive bearoff state.

Pip Counts

The pip count is the foundational metric of every backgammon position. It is the sum, across all of a player's checkers, of the pips each checker must travel to reach the bear-off tray. Formally:

$\text{Pip count} = \sum_{i=1}^{15} d_i$

where $d_i$ is the distance (in pips) from the $i$ -th checker's current point to that player's bear-off tray.

The opening pip count is 167 for each player:

$2 \times 24 + 5 \times 13 + 3 \times 8 + 5 \times 6$

$= 48 + 65 + 24 + 30 = 167$

The average roll in backgammon advances a player 8⅙ pips per turn (the expectation over the 21 distinct rolls weighted by the doubles convention, which counts each double four times). The expected number of turns to bring all checkers home and bear them off from the opening position is therefore approximately $167 / 8.17 \approx 20.4$ turns.

In a pure race, the leading pip count translates directly into a winning probability. Several closed-form approximations have been published. The two most cited are the Thorp Count and the Keith Count.

The Thorp Count and Keith Count

The Thorp Count (Edward Thorp, 1978) starts from the raw pip count and adjusts it for the things a plain count ignores: it adds a penalty for every checker still on the board (more checkers means more wastage in the bear-off), a penalty for checkers already piled on the 1-point, and a credit for each home-board point occupied; the leader's adjusted count is then inflated by a tenth before the two sides are compared. The comparison, not the raw pips, decides double, redouble and take.

The Keith Count (Tom Keith) is a later refinement of the same idea. It adds to the pip count for surplus checkers on the 1-, 2- and 3-points and for empty spaces on the 4-, 5- and 6-points — exactly the shapes that waste pips in the bear-off — and again inflates the leader's count by a fixed fraction before comparing. The Keith Count is the recommended manual race-equity formula in modern competitive play; the exact adjustment values and decision thresholds are in the published formulas.

For very precise race equity, players rely on an engine's bearoff database, but both Thorp and Keith remain canonical mental tools.

GamesGrid club members at the backgammon table

GamesGrid is coming back and you can be part of it.

Get your invitation

Race Equity and the 8-9-12 Rule

The standard race-cube decision rules apply when both sides are out of contact. The widely-cited 8-9-12 rule for the leader of a race summarises decades of rollout analysis into three thresholds:

Initial double: Leader's race advantage ≥ 8% of their pip count.
Redouble: Leader's race advantage ≥ 9% of their pip count.
Drop: Leader's race advantage over 12% of their pip count — the receiver should pass.

These thresholds are approximations. Exact race-equity tables (Snowie, GNUbg, XG) refine them position by position, accounting for wastage, crossovers, and the smoothness of the bearoff structure.

Cube Equity: The Take Point

The most-cited single result in backgammon mathematics is the dead-cube take point of 25%. Formally:

For a player offered a cube at value $C$ , accepting wins $+2C$ points and losing costs $-2C$ points; dropping costs $-C$ points unconditionally. Setting expected value of taking equal to the loss from dropping:

$p \cdot (+2C) + (1-p) \cdot (-2C) = -C$ $2pC - 2C + 2pC = -C$ $4pC - 2C = -C$ $p = \frac{1}{4} = 25\%$

So the receiver should take at any winning probability $p \geq 25\%$ , ignoring recube value.

With recube vigorish — the recipient's value from being able to redouble — the practical take point falls to roughly 21–22% in most positions. The exact reduction depends on the cube efficiency at later turn points and is computed by rollout in modern engine analysis.

The corresponding double point for the doubler — the equity at which doubling is correct — depends on cube efficiency (timing) and gammon prices, and is treated in detail on the match equity page.

Match Equity

In match play, the simple money equity gives way to match equity: the probability of winning the match from the current position, integrating the current game's outcome with all subsequent games at all reachable scores. The match equity at any score is computed from the Match Equity Table (MET), a two-dimensional table indexed by both players' away-scores.

The modern standard is the Rockwell-Kazaross MET, which is reproduced as a 9×9 core on the match equity page, with the full 25×25 canonical table available via GNU Backgammon.

The take point, double point, and gammon price all depend on the score, not just on the current game's winning chances. A 22% winning probability that is a money-game drop may be a clear take at certain match scores; a 50% winning position may be a "too good to double" at others.

The Janowski Formulas

The full MET is exact (to within the rollout precision used to derive it) but unwieldy to memorise. The Janowski-style closed-form approximations, derived from work by Rick Janowski and subsequent refinements, provide useful approximations that fit the table to within about 1–2% across most cells. Two distinct formulas are needed — one for normal pre-Crawford scores and one for Crawford-game scores.

Pre-Crawford (both players ≥ 2-away, cube in play):

$M = 0.5 + 0.87 \times \frac{D}{T + 6}$

Crawford-specific (one player at 1-away, cube removed):

$M = 0.525 + 0.57 \times \frac{D}{T + 2}$

In both, $D$ is the leader's lead in points (trailer's away-score minus leader's away-score) and $T$ is the trailer's away-score. The full derivation, the worked example, and the common mistake to avoid (using leader's away as $T$ ) are on the match equity page.

Neural Network Equity

Modern engines do not compute equity from closed-form formulas. They use trained neural networks that take a position vector — typically ~250 features encoding piece counts per point, distance to bearoff, exposure to direct and indirect shots, prime structure, anchors, builders, and more — and output an equity value or a distribution over win/gammon/backgammon outcomes.

The lineage from TD-Gammon (Tesauro, 1992) through Jellyfish, Snowie, GNU Backgammon, eXtreme Gammon (XG), BGBlitz, and Wildbg is covered on the Bots & AI page. The reference standard as of 2026 is XG2 rollouts, which combine forward search to several plies with neural-network leaf evaluation and Monte Carlo dice sampling at the truncation horizon.

Variance

A single backgammon game has a standard deviation of approximately 1.2 points per game on the resulting score (money play, no Jacoby). Across a 7-point match, the variance compounds and the standard error of skill measurement is on the order of 2.5–3.0 points per match — which means individual short matches do not reliably separate small skill differences. The standard separation tool is Performance Rating (PR), which measures error per move against a reference bot. Even over a full match PR still varies by several points; a stable PR needs many matches — a few thousand decisions — before it separates players reliably. See PR & ELO.