Choosing the zombie roster

Start with the world's basic zombie $b$ and configured pool $R_0$. The generator selects $k=4$ pool entries without replacement, using a bounded integer draw at each step. Weight does not participate in this choice.¹1Pool selection by indexThe builder adds the stage basic type, then chooses ZombieTypeCount entries from the configured pool. Each selected vector entry is removed before the next bounded draw. The baseline count is 4. Weight is not read by this selection pass.0x101ab6840

Removing the vector entry prevents that pool entry from being picked twice. A type with a large Weight has no larger interval in this initial draw: each remaining pool entry contributes one index.

The selected types, together with $b$, become available to the ordinary filler from the first wave. The pool choice and the eventual frequency of a type are therefore separate questions.

For $L>50$, an additional rule checks whether a selected type costs at least 1500 points. If none does, the last pool choice is replaced by a randomly chosen remaining type meeting that cost threshold. This is a WavePointCost test, not a test for the Gargantuar class.²2The high-cost replacementAbove BigZombieSureExistLevel, baseline 50, the helper checks for a selected type whose WavePointCost is at least 1500. If absent, it draws from qualifying remaining pool entries and replaces the last pool selection. The predicate concerns cost, not a particular runtime zombie class.0x101ab6d78

Let $S$ be the active types. For each type $i$, write $c_i$ for WavePointCost and $a_i$ for Weight. With $r$ points remaining, the positive-weight candidates form

Each candidate owns an integer interval of length $a_i$ in a bag of size $T(r)$. For the chosen ordering, let $C_i$ be the cumulative weight before $i$. A draw selects the unique interval containing $d$:³3The weighted integer bagThe ordinary filler drops candidates whose WavePointCost exceeds the remaining budget, draws through the integer weighted bag, appends the chosen type, and subtracts its cost. FirstWave and the separate Cost property are not inputs to these helpers. Bounded integer draws use modulo reduction; bag shares describe interval lengths, not a claim of perfectly uniform RNG residues.0x101ce7f08 · 0x100366650

The nominal share of the bag is $a_i/T(r)$. The bag is rebuilt as affordability changes; a type can disappear from consideration while still having a large weight. Filling ends when no positive-weight candidate fits, so the budget can leave a remainder.

Neither FirstWave nor the separate property named Cost is used by this filler. An entry's declared first wave is therefore not an additional gate on this path.

The materializer tracks which selected types have appeared in earlier instructions. Before filling the final wave normally, it visits the remaining unseen types in the active set’s order. It attempts to insert them in order, subtracting each admitted cost from the remaining budget. This pass uses a strict inequality:⁴4Strict final-wave reservationBefore normal final-wave filling, the materializer visits selected types not yet seen. A type is appended only when its cost is strictly less than the current remaining budget. The budget is reduced after each insertion, so ordering and earlier insertions affect later eligibility.0x101ce8598

An exact cost match can be accepted by ordinary filling and rejected by the reservation pass. Skipping a reservation does not remove that type from the later weighted bag. Earlier accepted reservations also reduce the balance for later ones.

For an ordered unseen pair costing 200 and 400 with 600 points left, the first insertion leaves an exact match for the second, which the reservation skips. Reversing the order changes which type receives the reservation. The filler can still draw an affordable skipped type afterward.

The ordering of a weighted bag affects its draw-to-type mapping. The native set is ordered by type pointers; equal costs and weights therefore do not make an arbitrary replacement order reproduce the same seeded sequence.⁵5Ordering and the component exampleThe native ordered-set comparator compares type-pointer values. The website uses selected display order and reconstructed integer draws. The isolated filler demonstrates budget spending; the construction and music views generate preceding waves, final reservation, per-instruction levels, and the level-wide leader attempt.0x100c03c8c

From level 4 onward, generation makes an extra wealth-entry attempt and an extra leader-entry attempt for the level, then assigns a successful entry to a chosen wave. This is not a fresh 0.4 leader roll on every wave. The baseline leader probability is 0.4; its type is selected by weight from types whose cost is strictly greater than 100.

The baseline wealth probability is zero, but its chance draw is still consumed. If both features are enabled and succeed, another draw suppresses one. A surviving extra entry is appended after ordinary filling without deducting its cost from the ordinary budget. World processing can then replace it, including clearing a removed leader’s marker when Jam constructs its replacement.⁶6Extra leader entriesThe materializer attempts extra entries from displayed level 4 onward. The shared baseline declares LeaderProbability = 0.4 and LeaderMinWaveCost = 100. Leader eligibility uses a strict cost-greater-than test, followed by weighted selection. Successful entries are appended outside the ordinary filler budget. Wealth probability is zero in this baseline, but its chance draw is still consumed.0x101ce8a54 · 0x101ab6840

Together with the wave plan, these rules explain how a point allowance becomes an ordered list of ordinary spawn instructions. Placement, strength, and timing operate on that result later.

The bag equations use the inspected integer stream: MT-style state, a 31-bit result, then modulo reduction for bounded draws. A zero seed becomes 4357. Different parts of generation own different stream states:⁷7Separate random-state consumersFresh DangerRoom initialization constructs designer state, materializes waves, runs world postprocessing, installs runtime actions and loot tags, then reseeds the WaveManager. Jam uses the global RNG; Modern queue shuffling calls imported C++ machinery. The website uses reconstructed integer draws with explicit input seeds and independent scenario state.0x101d47624 · 0x101c79bec · 0x101ce66dc · 0x100121044

GetSeed(1) reads time(NULL), but the timestamp alone does not specify every stream’s state or earlier consumption. Rejected duplicate choices, zero-probability attempts, and computed values that are later discarded can still advance a stream. The component controls expose their own input seeds so the individual rules remain reproducible.