# Existence and Construction of Reel Strips from Mathematical Specifications
*Paper · 2026 · Preprint*

Canonical page: https://gamemathemagics.com/#/p-01

> Turns reel strip design from a search problem into a construction. Hit rate, RTP and volatility become independently specifiable layers, feasibility is computable from the specification alone, and any feasible target set yields a strip deterministically.

DOI: https://doi.org/10.5281/zenodo.22139239
PDF: https://gamemathemagics.com/papers/reel-strip-construction.pdf
Same paper as plain text, for readers that cannot open a PDF: https://gamemathemagics.com/papers/reel-strip-construction.txt

### Abstract
The paper decomposes reel strip design into three mathematically independent layers. A rearrangement invariant on the mean symbol count per window (m = p·c) implies that ways-game RTP is a first-order quantity: it depends on per-reel means and blocker presences, never on within-window co-occurrence.

From that, window coverage p, conditional count c, and conditional count variance σ² can be specified independently per symbol per reel, controlling hit rate, RTP and volatility respectively. The main result guarantees that for any specification inside the characterized feasible set, a reel strip realizing all targets simultaneously exists and is constructible.

### Why it matters
The existing literature treats reel strip design as a forward search problem: genetic algorithms, variable neighborhood search, Monte Carlo fitness evaluation. All of it optimizes for RTP alone; hit rate and volatility come out as emergent properties, and none of it offers feasibility guarantees.

This work inverts the question. Rather than searching for strips that satisfy targets, it characterizes when targets are simultaneously satisfiable, and proves that satisfaction implies constructibility. The bounds are computable from the specification alone, so you know whether your targets are achievable before construction begins.

### Against prior work

| Capability | Hand tuning | GA | VNS | This work |
| --- | --- | --- | --- | --- |
| Independent hit-rate control | No | No | No | Yes |
| Independent RTP control | No | Partial | Partial | Yes |
| Independent volatility control | No | No | No | Yes |
| Wild symbols | Manual | No | No | Yes |
| Wild multipliers | Manual | No | No | Yes |
| Feasibility guarantee | No | No | No | Yes |
| Pre-computable bounds | No | No | No | Yes |
| Constructive (no search) | No | No | No | Yes |

Experienced practitioners reach complex designs through craft and iteration; the hand-tuning column is not an insult. The contribution is making that process systematic, guaranteed and decomposable.

### What it unlocks
With a constructive algorithm available, the reel strip stops being a design bottleneck. A mathematician building a multi-state feature normally spends most of development tuning strips per state: adjusting counts, running simulations, verifying RTP, iterating. When construction from targets is instant, they work one abstraction level higher, at the state machine itself, specifying per-state experience profiles and total-feature economics.

The reel strip is no longer a design artifact. It is a compiled output.