<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/rss.xsl"?>
<rss version="2.0"
  xmlns:atom="http://www.w3.org/2005/Atom"
  xmlns:content="http://purl.org/rss/1.0/modules/content/"
  xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>Ludologium — Research, Monographs &amp; Mechanism Audits</title>
    <link>https://ludologium.com/research</link>
    <description>Scholarly monographs, empirical mechanism assays, live-service field dossiers, and historical board/rulebook specimen studies from Ludologium.</description>
    <language>en-us</language>
    <lastBuildDate>Fri, 16 Oct 2026 12:00:00 GMT</lastBuildDate>
    <managingEditor>evelyna@evelynabellamy.com (Evelyna Bellamy)</managingEditor>
    <generator>Ludologium Syndication Builder</generator>
    <atom:link href="https://ludologium.com/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>LUD-ASSAY-01: House-Rule Entropy and Stopping-Time Drift</title>
      <link>https://ludologium.com/research/house-rule-entropy-and-stopping-time</link>
      <guid isPermaLink="true">https://ludologium.com/research/house-rule-entropy-and-stopping-time</guid>
      <pubDate>Fri, 16 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Empirical Assay</category>
      <category>Mechanism Design &amp; Liquidity Accounting</category>
      <description>Free Parking Pools, Skipped Auctions, and Why Kitchen-Table Variants Break Monopoly’s Stopping Clock — Almost everyone who hates Monopoly remembers a match that refused to end—yet almost nobody played Hasbro’s printed state machine. By placing Instruction Sheet 00009 alongside Elizabeth Magie’s 1904 patent and a one-step cash conservation identity, I audit how two nearly universal oral variants—routing fines into a Free Parking jackpot and skipping declined-property auctions—invert net bank drains without claiming a fabricated Sunday-evening minute count.</description>
      <content:encoded><![CDATA[<p><strong>LUD-ASSAY-01 · Empirical Assay · [DECLARED MODEL]</strong> — <em>Free Parking Pools, Skipped Auctions, and Why Kitchen-Table Variants Break Monopoly’s Stopping Clock</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-10-16 · <strong>Category:</strong> Mechanism Design &amp; Liquidity Accounting · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/research/house-rule-entropy-and-stopping-time">https://ludologium.com/research/house-rule-entropy-and-stopping-time</a></p>
<table><tbody><tr><td><strong>Printed Rule Baseline</strong></td><td>Hasbro Classic Monopoly (Instruction Sheet 00009)</td></tr><tr><td><strong>Historical Foil</strong></td><td>L. J. Magie US Patent 748,626 (1904) — 5-circuit clock</td></tr><tr><td><strong>Conserved Variable</strong></td><td>Aggregate non-bank table liquidity L_t = Σ c_{i,t}</td></tr><tr><td><strong>Constructed Delta</strong></td><td>+$450 net cash/window (printed) vs. +$1,300 (seeded pool)</td></tr></tbody></table>
<blockquote><p><strong>Core Thesis:</strong> When you replace Elizabeth Magie’s fixed five-circuit clock with last-player-standing elimination, bank taxes and mandatory auctions stop being minor penalties—they ARE the stopping clock.</p></blockquote>
<p>Almost everyone who hates Monopoly remembers a match that refused to end—yet almost nobody played Hasbro’s printed state machine. By placing Instruction Sheet 00009 alongside Elizabeth Magie’s 1904 patent and a one-step cash conservation identity, I audit how two nearly universal oral variants—routing fines into a Free Parking jackpot and skipping declined-property auctions—invert net bank drains without claiming a fabricated Sunday-evening minute count.</p>

<h2>1. Why an elimination loop needs a drain, not just rent transfers</h2>
<p>Ask a room of annoyed players why Monopoly drags and most blame bad dice or cruel rent spikes. Look at the accounting identity instead. At turn t across n players, let c_{i,t} be player i’s cash and L_t = Σ c_{i,t} be total cash outside the bank.</p>
<p>When Player A pays $28 rent to Player B, wealth concentrates, yet aggregate table liquidity L_t changes by $0. Only transactions with the bank move L_t: passing Go ($200) and bank dividend cards inject I_t, whereas Income Tax, Luxury Tax, Chance/Community Chest fines, mortgage interest, and house/hotel purchases withdraw S_t back into the bank.</p>
<p>In a last-player-standing elimination game, a player exits only when an enforceable obligation R_t exceeds their cash plus liquidation value V_{i,t}. Whenever a house rule reroutes a bank sink S_tax into a center-board pile that gets handed back to whichever token lands on Free Parking, S_tax collapses to zero across every completed jackpot cycle.</p>
<pre><code>L_{t+1} - L_t = I_t - S_t,   where   L_t = sum_{i=1..n} c_{i,t}
Elimination at turn t  &lt;=&gt;  R_t &gt; c_{i,t} + V_{i,t}</code></pre>

<h2>2. The two clauses oral tradition drops—and Magie’s 1904 clock</h2>
<p>Open Hasbro’s archived Classic Monopoly rule sheet (Instruction Sheet 00009) and two short clauses stand out immediately because so few households enforce them. First: 'A player landing on [Free Parking] does not receive any money, property or reward of any kind.' Second: 'If you do not wish to buy the property, the Banker sells it at auction to the highest bidder.'</p>
<p>Those clauses were doing structural work that Elizabeth Magie’s original 1904 Landlord’s Game did not rely on alone. In U.S. Patent 748,626, Magie bounded play explicitly by circuit count—ending the game after the first player completed five circuits of the board and tallying wealth (Magie, 1904). Once commercial Monopoly replaced a fixed-circuit horizon with total bankruptcy of all rivals, two mechanisms had to force convergence: rapid title allocation (mandatory auctions) and recurring liquidity drains (bank-collected taxes).</p>

<h2>3. Auditing the cash-flow swing in a declared accounting window</h2>
<p>Rather than inventing an undocumented 'average 3.4-hour game,' we can audit the exact accounting swing across one constructed four-player window in which four Go passes inject $800 total and scheduled tax/fine squares assess $350.</p>
<p>Under Sheet 00009, the bank absorbs that $350, leaving +$450 in net pre-building cash across the four hands—cash that is immediately competed away via mandatory auctions and house construction. Under the popular Free Parking jackpot rule seeded with a fresh $500 bill at setup and claimed within the window, S_tax vanishes ($0) and exogenous injection jumps to $1,300—nearly triple the liquidity cushion buffering trailing players against insolvency.</p>
<p>Meanwhile, dropping declined-property auctions freezes early state progression: whenever a cash-strapped player passes on a deed, the title stays inert in the bank for another full circuit instead of entering play at a discounted auction price, postponing monopolies and postponing the house-building sink that steepens R_t.</p>
<h3>Table 1 — Constructed Four-Player Cash Conservation Window (Declared Accounting Model)</h3>
<table><thead><tr><th>Rule Configuration</th><th>Go Stipends (I)</th><th>Tax/Fine Bank Sink (S_tax)</th><th>Jackpot Seed</th><th>Net Table Cash ΔL</th><th>Title Velocity &amp; Insolvency Effect</th></tr></thead><tbody><tr><td>Printed Rules (Sheet 00009)</td><td>+$800</td><td>-$350 (to Bank)</td><td>$0</td><td>+$450</td><td>100% unowned visits allocate deed; tight cash buffer</td></tr><tr><td>Fines Pooled on Free Parking</td><td>+$800</td><td>$0 (recycled)</td><td>$0</td><td>+$800</td><td>Zero tax drain over completed pool cycles</td></tr><tr><td>$500 Seeded Pool + No Auctions</td><td>+$800</td><td>$0 (recycled)</td><td>+$500</td><td>+$1,300</td><td>2.89× cash buffer + unbought deeds stall monopolies</td></tr><tr><td>Magie 1904 Patent Baseline</td><td>Fixed stipends</td><td>Public treasury</td><td>$0</td><td>Bounded clock</td><td>Terminates deterministically after 5 board circuits</td></tr></tbody></table>
<p><em>Constructed accounting comparison [DECLARED MODEL]. Actual turn counts depend on player bidding, trading, and mortgage policies.</em></p>

<h2>4. Where analytical math stops and empirical timing begins</h2>
<p>A conservation identity proves the direction and magnitude of cash inflation; it does not tell us how many minutes four cousins spend haggling over Baltic Avenue. Even a Monte Carlo simulator only measures turn distributions for the specific robotic bidding and trading heuristics coded into its agents.</p>
<p>Keeping primary rule texts [DOCUMENTED RECORD], cash-flow identities [DECLARED MODEL], and human session clocks [EMPIRICAL OBSERVATION REQUIRED] cleanly separated lets us explain exactly why house rules break Monopoly’s stopping condition without fabricating a laboratory stopwatch study.</p>
<h2>References (APA 7th)</h2>
<ul>
  <li>Hasbro. (n.d.). Monopoly instructions: Classic Monopoly rules [Instruction sheet 00009]. https://www.hasbro.com/common/instruct/00009.pdf — <a href="https://www.hasbro.com/common/instruct/00009.pdf">https://www.hasbro.com/common/instruct/00009.pdf</a></li>
  <li>Magie, L. J. (1904). Game-board (U.S. Patent No. 748,626). U.S. Patent and Trademark Office. https://patents.google.com/patent/US748626A/en — <a href="https://patents.google.com/patent/US748626A/en">https://patents.google.com/patent/US748626A/en</a></li>
  <li>Shubik, M. (2004). The theory of money and financial institutions (Vol. 1). MIT Press. — <a href="https://mitpress.mit.edu/9780262693110/">https://mitpress.mit.edu/9780262693110/</a></li>
</ul>]]></content:encoded>
    </item>
    <item>
      <title>LUD-DOSSIER-01: Patch Cadence and Metagame Half-Life</title>
      <link>https://ludologium.com/research/patch-cadence-and-metagame-half-life</link>
      <guid isPermaLink="true">https://ludologium.com/research/patch-cadence-and-metagame-half-life</guid>
      <pubDate>Wed, 14 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Field Dossier</category>
      <category>Live-Service Governance &amp; Equilibrium Dynamics</category>
      <description>When Fourteen-Day Balance Patches Overwrite Unmastered Counter-Play — Whenever an aggressive strategy dominates week-one ladder telemetry in a competitive game, two clocks race: endogenous player adaptation (discovering and mastering an in-system counter) versus exogenous developer intervention (patching frame data or resource costs). Contrasting unpatched cartridge ecosystems like NTSC v1.02 Melee against biweekly live-service cadences—backed by a mastery-indexed 3×3 payoff table—shows exactly how rapid patching truncates deep counter-discovery.</description>
      <content:encoded><![CDATA[<p><strong>LUD-DOSSIER-01 · Field Dossier · [COMPARATIVE AUDIT]</strong> — <em>When Fourteen-Day Balance Patches Overwrite Unmastered Counter-Play</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-10-14 · <strong>Category:</strong> Live-Service Governance &amp; Equilibrium Dynamics · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/research/patch-cadence-and-metagame-half-life">https://ludologium.com/research/patch-cadence-and-metagame-half-life</a></p>
<table><tbody><tr><td><strong>Frozen ROM Foil</strong></td><td>Super Smash Bros. Melee NTSC v1.02 (2001 — τ_patch = ∞)</td></tr><tr><td><strong>Live-Service Cadence</strong></td><td>Typical MOBA / Shooter / CCG window: τ_patch = 14–28 days</td></tr><tr><td><strong>Governing Condition</strong></td><td>Counter-play matures iff τ_adapt(s*) &lt; τ_patch</td></tr><tr><td><strong>Audit Failure Mode</strong></td><td>Conflating week-1 novice win rates with asymptotic payoff matrices</td></tr></tbody></table>
<blockquote><p><strong>Core Thesis:</strong> Patching faster than a community’s execution-learning curve nerfs balanced games and trains competitors to lobby patch notes instead of solving matchups.</p></blockquote>
<p>Whenever an aggressive strategy dominates week-one ladder telemetry in a competitive game, two clocks race: endogenous player adaptation (discovering and mastering an in-system counter) versus exogenous developer intervention (patching frame data or resource costs). Contrasting unpatched cartridge ecosystems like NTSC v1.02 Melee against biweekly live-service cadences—backed by a mastery-indexed 3×3 payoff table—shows exactly how rapid patching truncates deep counter-discovery.</p>

<h2>1. Two clocks in tension: τ_adapt versus τ_patch</h2>
<p>Watch any modern competitive game forty-eight hours after a major update and a familiar ritual unfolds: an accessible rushdown character or low-execution deck posts a 56% aggregate ladder win rate, social feeds declare the meta broken, and a hotfix arrives ten days later.</p>
<p>To analyze what was gained and what was destroyed, separate two clocks. Call τ_adapt(s*) the endogenous adaptation horizon: the time required for competitors to hypothesize, lab out, and reliably execute a counter-strategy against strategy s* under fixed rules. Call τ_patch the exogenous balance interval between developer modifications to the payoff matrix.</p>
<p>In classical tabletop games and pre-network cartridges, τ_patch is effectively infinite. Under modern two-week live-service schedules, any counter-strategy whose motor or tactical learning curve exceeds fourteen days gets overwritten before it can ever surface in tournament play.</p>
<pre><code>Endogenous counter-discovery survives iff   τ_adapt(s*) &lt; τ_patch</code></pre>

<h2>2. Proof by constructed payoff matrix: execution cost disguises equilibrium</h2>
<p>Because commercial publishers rarely release skill-conditional matchup matrices, let us write down a transparent 3-strategy zero-sum game where we know the true asymptotic math by construction. At full mastery, Strategy Alpha beats Beta (+1), Beta beats Gamma (+1), and Gamma beats Alpha (+1)—a symmetric cycle whose unique Nash equilibrium mixes (1/3, 1/3, 1/3) with expected value 0 for every strategy (Nash, 1950).</p>
<p>Now introduce realistic asymmetric execution difficulty. Suppose Alpha (say, a straightforward rushdown or curve deck) reaches full effectiveness after k = 10 practice games. Its structural counter Gamma (requiring frame-tight spacing, parry timing, or multi-turn resource sequencing) carries an execution penalty -c(k) = -1.4 at k = 10 matches that decays to 0 only once a player invests k ≥ 80 matches.</p>
<p>Look at what a telemetry dashboard sees in Week 1 (k = 10): Gamma’s realized payoff against Alpha is +1.0 - 1.4 = -0.4! On aggregate ladder charts, Alpha appears to beat BOTH Beta (+1.0) and its intended counter Gamma (+0.4). If the balance team nerfs Alpha on Day 14 based on unstratified Week-1 win rates, they break an asymptotically balanced game—and punish the specialists halfway through learning Gamma.</p>
<h3>Table 1 — Constructed Row-Player Payoff Matrix Under Asymmetric Execution Cost c(k)</h3>
<table><thead><tr><th>Matchup / Horizon</th><th>vs. Alpha</th><th>vs. Beta</th><th>vs. Gamma</th><th>Apparent Ladder Diagnosis</th></tr></thead><tbody><tr><td>Alpha (k = 10, easy execution)</td><td>0.0</td><td>+1.0</td><td>+0.4 (while Gamma unmastered)</td><td>Appears strictly dominant in Week 1!</td></tr><tr><td>Gamma at Week 1 (k = 10, penalty -1.4)</td><td>-0.4 (+1.0 - 1.4)</td><td>-2.4 (-1.0 - 1.4)</td><td>0.0</td><td>Looks unplayable (38% ladder win rate)</td></tr><tr><td>Gamma at Mastery (k ≥ 80, penalty 0.0)</td><td>+1.0 (true counter)</td><td>-1.0</td><td>0.0</td><td>Restores exact (1/3, 1/3, 1/3) Nash cycle</td></tr></tbody></table>
<p><em>Declared pedagogical payoff model [COMPARATIVE AUDIT] illustrating why unconditioned early win rates misclassify high-skill counters.</em></p>

<h2>3. What NTSC v1.02 Melee proved—and when patching is still mandatory</h2>
<p>Super Smash Bros. Melee (NTSC v1.02, 2001) offers a rare natural experiment in unpatched depth. Without a single balance patch across more than two decades, tier placements and matchup verdicts shifted repeatedly—from early Sheik/Marth dominance through Fox mastery, shield-drop counter-offense, Amsah teching, and Yoshi/Pikachu specialist breakthroughs—purely because players knew the frame table would still be there after five hundred hours of practice.</p>
<p>None of this implies developers should never patch. When a payoff matrix contains a genuine strictly dominant strategy—where no Gamma exists even at k = ∞, as in broken Day-0 combo loops or numeric overflow bugs—refusing to patch kills competitive play. The institutional discipline is knowing the difference: patch true degeneracies quickly, but measure matchup curves across player mastery quantiles before nerfing strategies whose counters simply take longer than two weeks to learn (Lanctot et al., 2019).</p>
<h2>References (APA 7th)</h2>
<ul>
  <li>Nash, J. F. (1950). Equilibrium points in n-person games. Proceedings of the National Academy of Sciences, 36(1), 48–49. https://doi.org/10.1073/pnas.36.1.48 — <a href="https://doi.org/10.1073/pnas.36.1.48">https://doi.org/10.1073/pnas.36.1.48</a></li>
  <li>Lanctot, M., Lockhart, E., Lespiau, J.-B., Zambaldi, V., Upadhyay, S., Pérolat, J., ... &amp; Bowling, M. (2019). OpenSpiel: A framework for reinforcement learning in games. arXiv. https://arxiv.org/abs/1908.09453 — <a href="https://arxiv.org/abs/1908.09453">https://arxiv.org/abs/1908.09453</a></li>
  <li>Hofbauer, J., &amp; Sigmund, K. (1998). Evolutionary games and population dynamics. Cambridge University Press. https://doi.org/10.1017/CBO9781139173179 — <a href="https://doi.org/10.1017/CBO9781139173179">https://doi.org/10.1017/CBO9781139173179</a></li>
</ul>]]></content:encoded>
    </item>
    <item>
      <title>LUD-MONO-02: The Topology of Choice</title>
      <link>https://ludologium.com/monographs/topology-of-choice</link>
      <guid isPermaLink="true">https://ludologium.com/monographs/topology-of-choice</guid>
      <pubDate>Sun, 11 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Monograph</category>
      <category>Game Trees &amp; Information</category>
      <description>A Small Tree, a Hidden State and the Price of Knowing — A game tree describes what can happen; an information set describes what a player can know when choosing. Two small constructed examples make that distinction inspectable and show why a search result depends on declared payoffs, observations and opponent assumptions. No equilibrium or reinforcement-learning result is claimed.</description>
      <content:encoded><![CDATA[<p><strong>LUD-MONO-02 · Monograph · [EDITORIAL TREATISE]</strong> — <em>A Small Tree, a Hidden State and the Price of Knowing</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-10-11 · <strong>Category:</strong> Game Trees &amp; Information · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/monographs/topology-of-choice">https://ludologium.com/monographs/topology-of-choice</a></p>
<p>A game tree describes what can happen; an information set describes what a player can know when choosing. Two small constructed examples make that distinction inspectable and show why a search result depends on declared payoffs, observations and opponent assumptions. No equilibrium or reinforcement-learning result is claimed.</p>

<h2>1. Count the choices before praising the search</h2>
<p>Imagine a player at a fork. Left leads to a gatekeeper who chooses between payoffs 3 and 1. Right leads to a gatekeeper who chooses between 2 and 0. The numbers are terminal utilities for the first player, not currency, probability or observed satisfaction. Both players see the entire tree. The gatekeeper wants to minimize that utility; the first player wants to maximize it. These assumptions define a constructed two-player zero-sum example.</p>
<p>Work backward. The gatekeeper selects 1 after Left and 0 after Right. The first player therefore selects Left for a guaranteed utility of 1 under the stated assumptions. Choosing the largest visible leaf, 3, would give the same initial direction here for the wrong reason; change Left to leaves 9 and −2, and that shortcut would select the branch whose guaranteed outcome is −2 rather than 0.</p>
<p>The result is small enough to verify on paper. It demonstrates a decision rule, not intelligent play in every game. If the gatekeeper prefers cooperation, makes errors or has a different payoff, the minimization step no longer describes that opponent. A search algorithm does not supply missing preferences.</p>

<h2>2. Hide a state, change the question</h2>
<p>Now replace the gatekeeper with a hidden token drawn before the player chooses. The token is Red or Blue, each with stipulated probability one half. Choosing Left pays 4 for Red and −2 for Blue. Choosing Right pays 1 regardless of color. The player knows the distribution and payoffs but cannot observe the token. This is another constructed game, not a poker model.</p>
<p>The two possible decision nodes belong to one information set: the player must choose the same action distribution in both because the states are indistinguishable at that moment. Without that constraint, an analyst could choose Left only in the Red state and Right only in Blue, giving the player knowledge the game never supplied.</p>
<p>Expected utility for Left is (4 + −2)/2 = 1; for Right it is 1. A risk-neutral player is indifferent under those probabilities. A player whose objective is the worst possible payoff chooses Right, whose minimum is 1 rather than −2. These are different objectives, not competing arithmetic answers to one fully specified question.</p>

<h2>3. Information has a value within the model</h2>
<p>If the token is revealed before the choice, selecting Left on Red and Right on Blue yields expected utility (4 + 1)/2 = 2.5. Under the risk-neutral assumptions, the gross value of that information is 1.5 compared with the unrevealed best expected utility of 1. If revelation costs more than 1.5 utility units, buying it would reduce expected utility. Nothing here says information is always worth its price.</p>
<p>This comparison isolates the order of observation and action. A cue that appears after a choice cannot be credited as if it appeared before. A strategy is therefore a plan for what the player will do at the information available to them, rather than a list of ideal actions selected with hindsight.</p>

<h2>4. The boundary of the tree</h2>
<p>Shannon’s 1950 chess paper offers a historical source for programmatic search and evaluation. The archive’s former numerical shorthand mixed an approximate branching calculation with claims that other methods became obsolete. Those claims are withdrawn. A uniform tree with branching factor b and depth d has b^d leaves; an actual game can have unequal branching, repeated states, early endings and expensive evaluation.</p>
<p>The useful design question is which choices and observations the model leaves out. Does a player know an opponent’s action? Are payoffs comparable? What happens when the horizon ends? Can a tree represent a simultaneous choice only by hiding an earlier move? Each answer changes what a computed recommendation means.</p>
<p>I would publish the tree, information sets, chance probabilities and utility convention beside the result. A reader should be able to reproduce the small example before trusting a large search claim. The topology of choice becomes meaningful when it tells us both where a player can go and what they are permitted to know on the way.</p>
<h2>References (APA 7th)</h2>
<ul>
  <li>Shannon, C. E. (1950). Programming a computer for playing chess. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 41(314), 256–275. https://doi.org/10.1080/14786445008521796 — <a href="https://doi.org/10.1080/14786445008521796">https://doi.org/10.1080/14786445008521796</a></li>
</ul>]]></content:encoded>
    </item>
    <item>
      <title>LUD-MONO-03: Ontology of the Rule</title>
      <link>https://ludologium.com/monographs/ontology-of-the-rule</link>
      <guid isPermaLink="true">https://ludologium.com/monographs/ontology-of-the-rule</guid>
      <pubDate>Sun, 11 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Monograph</category>
      <category>Rules &amp; Game Design</category>
      <description>One Checker Drop and the Choices It Makes Possible — The Classic Connect 4 drop rule makes some cells reachable and others unavailable at a given turn. A declared board position follows that one rule through immediate choice, tactical dependence and an intended experience, using MDA as a framework rather than as proof of what every player feels.</description>
      <content:encoded><![CDATA[<p><strong>LUD-MONO-03 · Monograph · [EDITORIAL TREATISE]</strong> — <em>One Checker Drop and the Choices It Makes Possible</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-10-11 · <strong>Category:</strong> Rules &amp; Game Design · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/monographs/ontology-of-the-rule">https://ludologium.com/monographs/ontology-of-the-rule</a></p>
<p>The Classic Connect 4 drop rule makes some cells reachable and others unavailable at a given turn. A declared board position follows that one rule through immediate choice, tactical dependence and an intended experience, using MDA as a framework rather than as proof of what every player feels.</p>

<h2>1. A rule is an operation</h2>
<p>A checker enters from the top of a column and settles in the lowest empty cell. That operation is easy to overlook because the plastic grid performs it for us. It is also the difference between choosing any empty square and choosing a column whose contents determine the square. The physical object makes the rule feel like a property of space.</p>
<p>The identified Hasbro Classic Connect 4 instruction sheet describes alternating checker drops and winning with four in a row. This essay concerns that Classic game, excluding the Pop Out and Pop 10 alternatives included elsewhere. Edition identity matters: a rule that permits removal from a column would change the reachability question.</p>
<p>Hunicke, LeBlanc and Zubek’s MDA paper distinguishes mechanics, dynamics and aesthetics. I use those levels to ask how an operation constrains play and what experience a designer might intend. The framework does not establish that a given rule produces the same feeling in all players.</p>

<h2>2. Work one position</h2>
<p>Use a seven-column, six-row teaching board. Number columns 1–7 from left to right and rows 1–6 from bottom to top. The bottom row is Red, Red, Red, empty, Yellow, Yellow, Yellow; all higher cells are empty. This is a legal constructed position reached by alternating drops into columns 1, 5, 2, 6, 3 and 7. Red is to move. The numbering and sequence are explicit so the reader can reproduce it.</p>
<p>Red can drop in column 4 and complete four along the bottom row. A drop in column 1 lands in row 2, not row 1, because the lower cell is already occupied. A drop in column 5 likewise lands above Yellow. Those distinctions follow from the drop rule and the stated occupancy. They do not require guessing what a skilled player would do.</p>
<p>If Red chooses column 1 instead, Yellow can choose column 4 on the next turn and complete a bottom-row run across columns 4–7. The example therefore gives the same empty cell two different meanings: Red’s immediate win before the move, and Yellow’s immediate win after Red ignores it. The rule is fixed; the relation between a move and the next player changes.</p>

<h2>3. Change the operation, keep the picture</h2>
<p>Now invent a variant that allows a checker to occupy any empty cell, without support. The drawn board may look identical, but a player has many more legal placements. A threat in row 3 no longer needs the cells beneath it filled. This is a constructed rule change, not a claim about a Hasbro variant or an improvement in balance.</p>
<p>The altered mechanic removes one dependency and creates a different choice structure. We can inspect reachable cells directly. We cannot conclude from that count that the variant is more fun, easier, deeper or fairer. Those words refer to goals and responses that the legal-move set does not measure.</p>
<p>Using MDA, the drop operation is the mechanic; players’ use of supported cells to make or prevent threats belongs to the dynamics of play. Anticipation or tension is a proposed aesthetic aim. We would need actual sessions to learn whether the participants experience it, and which rules they understand well enough to use.</p>

<h2>4. What the rule promises</h2>
<p>A tutorial should teach the dependency, not merely animate a falling disc. It can ask the learner to identify where a checker will land, then show why the tempting upper cell is unavailable. The position above offers an immediate check: choose the winning column and explain the opponent’s reply if it is ignored. This essay provides the exercise; it does not report a learning outcome.</p>
<p>There are boundary cases. A full column cannot accept another checker. A game can end before every cell is filled. The current player and winning condition belong to the state alongside occupancy. A representation that shows only a pleasing grid can omit the very information needed to decide whether an action is legal.</p>
<p>The ontology of the rule is practical: identify the operation, the state it reads, the state it changes and the conditions that stop it. Then distinguish what follows mathematically from what players do and feel. One rule can give a space its grammar without giving us permission to invent the reader’s experience.</p>
<h2>References (APA 7th)</h2>
<ul>
  <li>Hasbro. (n.d.). Classic Connect 4 [Instruction booklet]. Hasbro. https://www.hasbro.com/common/documents/dad2614d1c4311ddbd0b0800200c9a66/DE3C8F8050569047F5AA9FBB9F16909B.pdf — <a href="https://www.hasbro.com/common/documents/dad2614d1c4311ddbd0b0800200c9a66/DE3C8F8050569047F5AA9FBB9F16909B.pdf">https://www.hasbro.com/common/documents/dad2614d1c4311ddbd0b0800200c9a66/DE3C8F8050569047F5AA9FBB9F16909B.pdf</a></li>
  <li>Hunicke, R., LeBlanc, M., &amp; Zubek, R. (2004). MDA: A formal approach to game design and game research. AAAI Workshop on Challenges in Game AI. https://aaai.org/papers/ws04-04-001-mda-a-formal-approach-to-game-design-and-game-research/ — <a href="https://aaai.org/papers/ws04-04-001-mda-a-formal-approach-to-game-design-and-game-research/">https://aaai.org/papers/ws04-04-001-mda-a-formal-approach-to-game-design-and-game-research/</a></li>
</ul>]]></content:encoded>
    </item>
    <item>
      <title>LUD-MONO-04: The Emulation Dilemma</title>
      <link>https://ludologium.com/monographs/emulation-dilemma</link>
      <guid isPermaLink="true">https://ludologium.com/monographs/emulation-dilemma</guid>
      <pubDate>Sun, 11 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Monograph</category>
      <category>Game Preservation</category>
      <description>Preserving a Target and Declaring a Play Configuration — A preservation target and a preferred play experience can require different configurations. A declared Super Mario Bros. case separates the archival object, emulator version and full input-to-display path, while an illustrative timing calculation shows why a frame count cannot certify how a tested system feels.</description>
      <content:encoded><![CDATA[<p><strong>LUD-MONO-04 · Monograph · [EDITORIAL TREATISE]</strong> — <em>Preserving a Target and Declaring a Play Configuration</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-10-11 · <strong>Category:</strong> Game Preservation · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/monographs/emulation-dilemma">https://ludologium.com/monographs/emulation-dilemma</a></p>
<p>A preservation target and a preferred play experience can require different configurations. A declared Super Mario Bros. case separates the archival object, emulator version and full input-to-display path, while an illustrative timing calculation shows why a frame count cannot certify how a tested system feels.</p>

<h2>1. Name the object</h2>
<p>A player says that a game feels right. An archivist says that a version is preserved. Both judgments matter, but they refer to different evidence. The first needs a person, a task and a configuration. The second needs an identified object and a record of what must remain available to interpret or execute it.</p>
<p>For a concrete discussion, take Nintendo’s Super Mario Bros. for the NES, identified by Nintendo as the 1985 game. The proposed comparison target is a North American NTSC NES release, not the PAL release, the Super Mario All-Stars adaptation or a later port. No cartridge revision or ROM hash has been supplied in this essay, so the target is not yet a uniquely identified binary and no benchmark result is asserted.</p>
<p>Use the archived Windows x64 release of FCEUX 2.6.6 as the declared software candidate, rather than saying “the latest emulator.” The developer’s release record identifies that version. Selection here is a comparison specification, not a recommendation, a certification of cycle accuracy or evidence that I ran the game on it.</p>

<h2>2. The missing configuration is part of the claim</h2>
<p>A completed comparison would record the cartridge or authorized image identity, console board revision, controller, display and signal path. For the emulator it would additionally record the operating system build, executable hash, video backend, audio settings, synchronization options, scaling and any timing intervention. The same game title can pass through materially different systems.</p>
<p>These entries are deliberately still unresolved here. Inventing a familiar CRT model or a contemporary monitor would make the prose look concrete while supplying no observation. The useful case identifies what the archive knows and what a later measurement must pin down. A preservation note can be complete as an argument without pretending to contain an experiment.</p>
<p>The Library of Congress’s 2024–2025 Recommended Formats Statement includes software and video-game submission guidance for builds, documentation and dependencies. That dated document supports the need to preserve interpretable software objects. It does not certify the feel of this emulator configuration or declare that one hardware technology guarantees authenticity.</p>

<h2>3. A timing example that does not impersonate a test</h2>
<p>Suppose an illustrative pipeline samples input after a one-frame wait, processes it over one frame, and buffers presentation for two frames. At a stipulated 60 frames per second, the four-frame total is about 66.7 milliseconds. Remove one buffering frame and the model becomes 50 milliseconds. These are authored assumptions for arithmetic, not measurements of Super Mario Bros., a NES, FCEUX or any display.</p>
<p>Real sampling can depend on when the button changes relative to the polling cycle and scanout. A single average can hide variability. A defensible input-to-photon study would state the electrical or physical trigger, the visible response criterion, sensor position, clock or camera calibration, repetition count and distribution. It would retain unsuccessful or ambiguous trials rather than selecting a persuasive clip.</p>
<p>Subjective preference asks a further question. A participant might prefer a shorter response path, a particular controller or a familiar display treatment. That preference is valuable evidence about that participant under the stated conditions. It cannot establish that the altered configuration reproduces the historical object more accurately.</p>

<h2>4. Preserve the choice as well</h2>
<p>I would keep a preservation configuration with documented assumptions and a separately named play configuration with its adaptations visible. If a timing feature changes when a response is shown, disclose it beside the setting. If a shader approximates a display appearance, name it as an authored approximation. Neither feature should borrow the authority of an unmeasured historical comparison.</p>
<p>There is a practical complication: original hardware can fail, replacement parts can change behavior, and a preserved executable can lose the environment it expects. Treating one machine as a permanent gold standard ignores that maintenance history. Reproducibility needs versions and configurations at the time of observation.</p>
<p>The emulation dilemma is not solved by choosing software or silicon once. It is managed by making the target and the adaptation legible. We can preserve a route back to the documented object while allowing people to choose how they play. The archive earns trust when a preference stays a preference and a measurement comes with enough information to be repeated.</p>
<h2>References (APA 7th)</h2>
<ul>
  <li>Nintendo. (1985). Super Mario Bros. [NES video game; publisher record]. Nintendo. https://www.nintendo.com/es-es/Juegos/NES/Super-Mario-Bros-803853.html — <a href="https://www.nintendo.com/es-es/Juegos/NES/Super-Mario-Bros-803853.html">https://www.nintendo.com/es-es/Juegos/NES/Super-Mario-Bros-803853.html</a></li>
  <li>FCEUX contributors. (2023). FCEUX 2.6.6 [Computer software; archived release]. GitHub. https://github.com/TASEmulators/fceux/releases/tag/v2.6.6 — <a href="https://github.com/TASEmulators/fceux/releases/tag/v2.6.6">https://github.com/TASEmulators/fceux/releases/tag/v2.6.6</a></li>
  <li>Library of Congress. (2024). Recommended Formats Statement 2024–2025: Software and video games. Library of Congress. https://www.loc.gov/preservation/resources/rfs/RFS-2024-2025_ArchivalOnly.pdf — <a href="https://www.loc.gov/preservation/resources/rfs/RFS-2024-2025_ArchivalOnly.pdf">https://www.loc.gov/preservation/resources/rfs/RFS-2024-2025_ArchivalOnly.pdf</a></li>
</ul>]]></content:encoded>
    </item>
    <item>
      <title>LUD-MONO-05: Metagame Dynamics</title>
      <link>https://ludologium.com/monographs/metagame-dynamics</link>
      <guid isPermaLink="true">https://ludologium.com/monographs/metagame-dynamics</guid>
      <pubDate>Sun, 11 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Monograph</category>
      <category>Strategy &amp; Declared Models</category>
      <description>A Declared Payoff Patch and the Difference Between Incentive and Adoption — A rule change alters the incentives a player faces; it does not by itself tell us how quickly players adapt. A small constructed payoff table follows a versioned patch through best responses, then separates that arithmetic from the telemetry needed to describe an actual metagame.</description>
      <content:encoded><![CDATA[<p><strong>LUD-MONO-05 · Monograph · [EDITORIAL TREATISE]</strong> — <em>A Declared Payoff Patch and the Difference Between Incentive and Adoption</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-10-11 · <strong>Category:</strong> Strategy &amp; Declared Models · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/monographs/metagame-dynamics">https://ludologium.com/monographs/metagame-dynamics</a></p>
<p>A rule change alters the incentives a player faces; it does not by itself tell us how quickly players adapt. A small constructed payoff table follows a versioned patch through best responses, then separates that arithmetic from the telemetry needed to describe an actual metagame.</p>

<h2>1. The patch is only the beginning</h2>
<p>A patch note names a changed number. A player still has to notice it, understand the interaction and decide whether to give up a familiar strategy. The gap between those events is where a metagame becomes interesting. Treating a new rule as an instantly reached equilibrium skips the people who have to make it real.</p>
<p>This essay uses a constructed game, not a Riot API dataset or a measurement of a live-service title. Version A and Version B are authored teaching specifications dated 11 October 2026. Each player chooses either Guard or Rush simultaneously. There are no items, skill differences, matchmaking, draws, repeated-match rewards or hidden modifiers. The model is intentionally smaller than competitive play.</p>

<h2>2. Work the two versions</h2>
<p>In Version A, Guard against Guard gives each player 2 utility units. Rush against Guard gives the rusher 3 and the guard 0. Rush against Rush gives each 1. The payoff ordering is stipulated, not fitted from matches. If the opponent guards, rushing gives 3 instead of 2; if the opponent rushes, rushing gives 1 instead of 0. Rush is a strictly better response in both cases.</p>
<p>The patch in Version B changes only the Rush-against-Guard payoff: the rusher now receives 1 and the guard receives 3. The symmetric outcomes stay at 2 each for Guard–Guard and 1 each for Rush–Rush. Against Guard, Guard now gives 2 rather than 1. Against Rush, Guard gives 3 rather than 1. Guard is now the strictly better response in both cases.</p>
<p>Under the defined one-shot utilities, the mutual best-response outcome therefore changes from Rush–Rush to Guard–Guard. That is a result about these tables. It does not imply that a real community switches immediately, that every patch reverses a dominant strategy, or that the new outcome is more enjoyable.</p>

<h2>3. Arithmetic is not adoption</h2>
<p>Suppose, as another declared scenario, half of the players initially keep rushing because they have not read the patch. The best-response calculation does not tell us how many will change after ten matches. To answer that question, a model needs an update rule: what a player observes, how they estimate payoffs and how they revise a policy. Choosing that rule is another assumption.</p>
<p>Even an actual choice-frequency increase would need interpretation. A strategy may appear more often because a tutorial promotes it, a popular player demonstrates it, matchmaking changes the population or the available opponents reward it. The patch can be a plausible cause without being the only changed input. Wins among self-selected users of a strategy are not automatically its causal advantage.</p>
<p>MDA supplies a useful distinction between the specified mechanic and the dynamics of play. Here, the changed payoff is part of the mechanic; the evolving distribution of player choices would be a dynamic outcome. The intended experience of more interesting defense is a design judgment, not a value computed from the table.</p>

<h2>4. What a real metagame report would preserve</h2>
<p>An empirical report should identify the game version, queue, region, observation dates, player population and selection filters. Its denominator should distinguish matches, players and opportunities to choose. A before-and-after comparison should preserve enough context to tell whether other balance changes, rank distributions or reporting rules changed at the same time.</p>
<p>It should also distinguish discovery from confirmation. Finding a promising strategy in one sample and reporting its apparent success in that same sample can exaggerate the result. A declared later validation window, uncertainty intervals and a record of competing strategies would make the claim easier to inspect. This essay contains none of those measurements.</p>
<p>The former claim that all live-service rulebooks change every fourteen days is withdrawn, as is the implication that chess or football rules are timeless. Patch cadence and historical rule change require identified cases. This smaller argument does not need those universals.</p>
<p>A metagame is an account of choices around a game, not merely a new row in its rule table. The table tells us what a declared rational response would be. The community tells us what people learned, copied, resisted or preferred. An archive should keep those records connected without allowing one to impersonate the other.</p>
<h2>References (APA 7th)</h2>
<ul>
  <li>Hunicke, R., LeBlanc, M., &amp; Zubek, R. (2004). MDA: A formal approach to game design and game research. AAAI Workshop on Challenges in Game AI. https://aaai.org/papers/ws04-04-001-mda-a-formal-approach-to-game-design-and-game-research/ — <a href="https://aaai.org/papers/ws04-04-001-mda-a-formal-approach-to-game-design-and-game-research/">https://aaai.org/papers/ws04-04-001-mda-a-formal-approach-to-game-design-and-game-research/</a></li>
</ul>]]></content:encoded>
    </item>
    <item>
      <title>LUD-MONO-01: The Georgist Engine</title>
      <link>https://ludologium.com/monographs/georgist-engine</link>
      <guid isPermaLink="true">https://ludologium.com/monographs/georgist-engine</guid>
      <pubDate>Sat, 10 Oct 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Monograph</category>
      <category>Mechanism Design &amp; Historical Economics</category>
      <description>Following the money through Magie’s rules and a declared teaching model — A payment can reward an owner, enter a treasury or return to the players. Those destinations change a game’s incentives. I compare the stated purposes and rules of Magie’s 1904 and 1924 patents, then work through a small transfer example. It clarifies a mechanism without claiming to simulate Monopoly or prove a policy outcome.</description>
      <content:encoded><![CDATA[<p><strong>LUD-MONO-01 · Monograph · [EDITORIAL TREATISE]</strong> — <em>Following the money through Magie’s rules and a declared teaching model</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-10-10 · <strong>Category:</strong> Mechanism Design &amp; Historical Economics · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/monographs/georgist-engine">https://ludologium.com/monographs/georgist-engine</a></p>
<p>A payment can reward an owner, enter a treasury or return to the players. Those destinations change a game’s incentives. I compare the stated purposes and rules of Magie’s 1904 and 1924 patents, then work through a small transfer example. It clarifies a mechanism without claiming to simulate Monopoly or prove a policy outcome.</p>

<h2>1. The destination of a payment</h2>
<p>A token stops on somebody else’s property, and money crosses the table. That small movement is the part of a property game I want to inspect first. Who receives the payment? Can that recipient use it to collect more payments? Does it remain among the players, enter a bank, or return through a common fund? A board can look almost unchanged while the answers produce a different system.</p>
<p>This is a useful way to approach Elizabeth Magie’s Landlord’s Game. It keeps the rules available for inspection before the familiar origin story supplies a moral. A political purpose, a rule mechanism and a player’s experience are related, but they need different evidence. A patent can describe an intended lesson. A specified ledger can show a transfer. Neither alone establishes what every player learns or how a complete game usually ends.</p>
<p>My argument is that rule design becomes clearer when we follow one consequential payment all the way through its destination and possible return. This is a smaller claim than saying a board game proves an economic theory. It gives us something we can actually check.</p>

<h2>2. Two patents, two kinds of evidence</h2>
<p>The 1904 patent, issued to Lizzie J. Magie, describes lots, payments, a public treasury and a winner determined by accumulated wealth after an agreed number of circuits. That is a particular rule document. Its terminology and stopping condition should not be silently replaced by those of a later commercial game (Magie, 1904, opening specification and play instructions).</p>
<p>The 1924 patent, issued to Elizabeth Magie Phillips, makes an educational purpose explicit. It describes showing the landlord’s advantage under prevailing land tenure and how a single tax would discourage speculation. It also describes a cash goal of $3,000 that players may raise. This is primary evidence for her stated purpose in that edition, rather than a political intention inferred from dice or reconstructed from the later Monopoly board (Phillips, 1924, opening specification).</p>
<p>A purpose is not an outcome measure. Players might recognise the intended criticism, admire a successful landlord or concentrate on winning. The patent does not settle those possibilities. I would keep the author’s stated aim beside the mechanism, then ask what observation or research would be needed to establish a learning effect. That preserves the political argument without turning intention into a claim about behaviour.</p>
<p>Edition identity also prevents an easy historical shortcut. These two patents are not a licence to attribute every later cooperative variant, house rule or commercial choice to the earliest document. A comparison needs to name the version it actually reads.</p>

<h2>3. A transfer small enough to inspect</h2>
<p>Here is a constructed teaching model. There are two players, A and B, with $100 each. A single event requires B to pay $10. There are no dice, property purchases, debts, wages or later turns. We compare only the destination of this payment and one explicitly defined redistribution. The amounts are selected for arithmetic clarity; they are not historical rent values.</p>
<p>In the private-transfer case, B pays A. A ends with $110 and B with $90. The combined balance remains $200, but the gap is $20: one balance rose by $10 while the other fell by $10. Looking only at the payer’s loss would miss half the change in the gap.</p>
<p>In the fund case, B pays a common fund instead. Before redistribution, A has $100, B has $90 and the fund has $10. We then return half of the fund to each player. A ends with $105, B with $95 and the fund with $0. The total remains $200 and the gap is $10. These outputs follow from the declared transfers; they do not require a simulation.</p>
<p>The comparison isolates one mechanism: the recipient and redistribution rule affect the resulting balances. It does not show that a common-fund game is always fair, that every player benefits, or that real land taxation produces these amounts. A still ends ahead, because only B paid this fee. Change who pays, how the fund is divided or what the next turn permits, and you change the question. A model becomes more useful when its smallness is explicit.</p>

<h2>4. Movement is only one part of the game</h2>
<p>A dice model answers a different question. With two independent fair six-sided dice, a total of seven occurs in six of the 36 equally likely ordered outcomes; twelve occurs in one. The formula below records that triangular sum distribution. It describes a throw, not the eventual distribution of property or wealth.</p>
<p>A position-only transition matrix can describe a stripped-down token moving around a loop. A Monopoly model needs more: the chosen edition’s cards, doubles and jail rules, ownership, cash, auctions, construction, debt, and policies for decisions. A token’s square does not contain enough information to tell us whether its owner can pay the next rent. Adding the missing states is part of specifying the model, not an optional detail after the result.</p>
<p>There is also a choice about what we mean by advantage. Landing frequency concerns movement. Cash concerns liquidity. Property holdings concern potential future income. Remaining in the game concerns survival. A claim that one rule improves a player’s position must say which of these is being evaluated. The transfer example above measures the cash gap after one declared event and makes no claim about any of the others.</p>
<pre><code>P(X = k) = \frac{6 - |k - 7|}{36} \quad k \in \{2, \dots, 12\}</code></pre>

<h2>5. The rule at your table is another edition</h2>
<p>Hasbro’s archived instruction sheet numbered 00009 includes a Classic Monopoly section. In that section, declined purchases go to auction, taxes and fines are collected by the bank, and Free Parking gives no reward. The sheet also includes a separate Speed Die option; that option is outside the comparison here (Hasbro, n.d., Classic Monopoly rules).</p>
<p>A jackpot funded by taxes and fines therefore creates another destination for money. Omitting auctions creates another acquisition procedure. Both changes are worth studying, but a description of their resource flows is not enough to predict a game’s duration. This archive’s earlier duration estimates had no reproducible run behind them and remain withdrawn.</p>
<p>A proper experiment would identify the edition and every altered rule, define the players’ policies, preserve random seeds, name a stopping condition and report incomplete games as well as completed ones. It would measure turn counts before trying to infer elapsed minutes. Trading and negotiation introduce human time that a token-movement model does not contain.</p>
<p>The table offers a practical version of the same discipline. When someone proposes a house rule, ask where the payment goes, what opportunity it creates, who can use that opportunity and what would count as improvement. The answer may be an enjoyable variation rather than a more balanced game. Naming that purpose is useful. It lets the players choose the system they are making, instead of treating a familiar-looking board as a guarantee that they are all playing the same game.</p>
<h2>References (APA 7th)</h2>
<ul>
  <li>Magie, L. J. (1904). Game-board (U.S. Patent No. 748,626). U.S. Patent and Trademark Office. https://patents.google.com/patent/US748626A/en — <a href="https://patents.google.com/patent/US748626A/en">https://patents.google.com/patent/US748626A/en</a></li>
  <li>Phillips, E. M. (1924). Game board (U.S. Patent No. 1,509,312). U.S. Patent and Trademark Office. https://patents.google.com/patent/US1509312A/en — <a href="https://patents.google.com/patent/US1509312A/en">https://patents.google.com/patent/US1509312A/en</a></li>
  <li>Hasbro. (n.d.). Monopoly instructions: Classic Monopoly rules [Instruction sheet 00009]. https://www.hasbro.com/common/instruct/00009.pdf — <a href="https://www.hasbro.com/common/instruct/00009.pdf">https://www.hasbro.com/common/instruct/00009.pdf</a></li>
</ul>]]></content:encoded>
    </item>
    <item>
      <title>LUD-ASSAY-02: The Monopoly Autopsy &amp; Georgist Transfer Simulator</title>
      <link>https://ludologium.com/autopsy</link>
      <guid isPermaLink="true">https://ludologium.com/autopsy</guid>
      <pubDate>Mon, 28 Sep 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Empirical Assay</category>
      <category>Mechanism Design</category>
      <description>Comparing Elizabeth Magie’s 1904 Single-Tax treasury against private rent extraction and kitchen-table house rules — Interactive mechanism laboratory contrasting treasury redistribution with private rent compounding across declared parameter settings.</description>
      <content:encoded><![CDATA[<p><strong>LUD-ASSAY-02 · Empirical Assay · [INTERACTIVE MODEL]</strong> — <em>Comparing Elizabeth Magie’s 1904 Single-Tax treasury against private rent extraction and kitchen-table house rules</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-09-28 · <strong>Category:</strong> Mechanism Design · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/autopsy">https://ludologium.com/autopsy</a></p>
<table><tbody><tr><td><strong>Historical Dual Rule</strong></td><td>1904 Single-Tax Prosperity vs. Monopolist Rule</td></tr><tr><td><strong>Tracked Metrics</strong></td><td>Gini Wealth Concentration · Treasury Balance · Solvency</td></tr><tr><td><strong>Primary Patent</strong></td><td>U.S. Patent 748,626 (Elizabeth J. Magie, Jan 5, 1904)</td></tr></tbody></table>
<p>Interactive mechanism laboratory contrasting treasury redistribution with private rent compounding across declared parameter settings.</p>
<p>Elizabeth Magie designed The Landlord’s Game (1904) not as a celebration of real-estate empire, but as an executable demonstration of Henry George’s land-value tax: one physical board playable under two opposing fiscal constitutions.</p>
<p>Under the Monopolist ruleset, land rent compounds privately until trailing players go bankrupt; under the Single-Tax Prosperity ruleset, land rents flow into a public treasury that funds shared infrastructure and raises every player’s floor.</p>
<p>The Monopoly Autopsy (/autopsy) lets visitors toggle directly between both rule constitutions and inspect wealth trajectories turn by turn under declared simulation assumptions.</p>
<p><a href="https://ludologium.com/autopsy">Open interactive laboratory &amp; primary dataset at https://ludologium.com/autopsy →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-ASSAY-03: Achievement Friction &amp; Milestone Attrition Funnels</title>
      <link>https://ludologium.com/achievement-friction</link>
      <guid isPermaLink="true">https://ludologium.com/achievement-friction</guid>
      <pubDate>Tue, 22 Sep 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Empirical Assay</category>
      <category>Player Telemetry</category>
      <description>Global completion drop-off curves, onboarding bottlenecks, and mastery tails across Steamworks achievement records — Empirical audit of player progression funnels, distinguishing early tutorial friction from optional late-game mastery thresholds.</description>
      <content:encoded><![CDATA[<p><strong>LUD-ASSAY-03 · Empirical Assay · [TELEMETRY AUDIT]</strong> — <em>Global completion drop-off curves, onboarding bottlenecks, and mastery tails across Steamworks achievement records</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-09-22 · <strong>Category:</strong> Player Telemetry · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/achievement-friction">https://ludologium.com/achievement-friction</a></p>
<table><tbody><tr><td><strong>Primary Telemetry</strong></td><td>Public Steamworks Global Achievement Percentages</td></tr><tr><td><strong>Diagnostic Split</strong></td><td>Onboarding Drop-Off vs. Endgame Mastery Tail</td></tr><tr><td><strong>Confound Control</strong></td><td>Unlaunched library ownership &amp; bundle dilution</td></tr></tbody></table>
<p>Empirical audit of player progression funnels, distinguishing early tutorial friction from optional late-game mastery thresholds.</p>
<p>Public Steam achievement unlock percentages form one of the largest open behavioral funnels in digital media—yet raw percentages mislead whenever bundle buyers who never booted the executable sit in the denominator.</p>
<p>The Achievement Friction audit (/achievement-friction) normalizes milestone progression against first-action activation ('booted and cleared Tutorial 1') to separate genuine mechanical walls—where active players quit in frustration—from healthy optional mastery challenges.</p>
<p><a href="https://ludologium.com/achievement-friction">Open interactive laboratory &amp; primary dataset at https://ludologium.com/achievement-friction →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-ASSAY-04: Executable Game Theory Protocols: Prisoner’s Dilemma, Stag Hunt &amp; Kuhn Poker</title>
      <link>https://ludologium.com/game-theory</link>
      <guid isPermaLink="true">https://ludologium.com/game-theory</guid>
      <pubDate>Fri, 18 Sep 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Empirical Assay</category>
      <category>Mathematical Game Theory</category>
      <description>Inspecting dominant strategies, assurance equilibria, and imperfect-information bluffing thresholds — Playable normal-form and extensive-form game-theory protocols grounded in OpenSpiel mathematical definitions.</description>
      <content:encoded><![CDATA[<p><strong>LUD-ASSAY-04 · Empirical Assay · [EXECUTABLE FORMALISM]</strong> — <em>Inspecting dominant strategies, assurance equilibria, and imperfect-information bluffing thresholds</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-09-18 · <strong>Category:</strong> Mathematical Game Theory · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/game-theory">https://ludologium.com/game-theory</a></p>
<table><tbody><tr><td><strong>Canonical Games</strong></td><td>Prisoner’s Dilemma · Stag Hunt · Matching Pennies · Kuhn Poker</td></tr><tr><td><strong>Representations</strong></td><td>Normal-Form Payoff Bimatrix &amp; Extensive-Form Information Sets</td></tr><tr><td><strong>Reference Standard</strong></td><td>Nash (1950), Kuhn (1950), &amp; DeepMind OpenSpiel</td></tr></tbody></table>
<p>Playable normal-form and extensive-form game-theory protocols grounded in OpenSpiel mathematical definitions.</p>
<p>Static textbook bimatrices often obscure how dramatically strategic behavior changes when play repeats, when risk-dominance conflicts with payoff-dominance (Stag Hunt), or when private cards introduce imperfect information sets (Kuhn’s 1950 three-card poker).</p>
<p>In the Executable Game Theory chamber (/game-theory), visitors manipulate payoff entries and mixed-strategy probabilities directly to watch best-response regions, Pareto frontiers, and optimal bluffing frequencies update in real time.</p>
<p><a href="https://ludologium.com/game-theory">Open interactive laboratory &amp; primary dataset at https://ludologium.com/game-theory →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-DOSSIER-02: Patch Genealogy &amp; Downstream Systemic Rule Mutations</title>
      <link>https://ludologium.com/patch-genealogy</link>
      <guid isPermaLink="true">https://ludologium.com/patch-genealogy</guid>
      <pubDate>Mon, 14 Sep 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Field Dossier</category>
      <category>Rule Evolution</category>
      <description>Tracing how single parameter edits propagate across item economies, role viability, and strategic topologies — Longitudinal dossier following rule perturbations and second-order incentive shifts across live competitive ecosystems.</description>
      <content:encoded><![CDATA[<p><strong>LUD-DOSSIER-02 · Field Dossier · [VERSIONED RULES]</strong> — <em>Tracing how single parameter edits propagate across item economies, role viability, and strategic topologies</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-09-14 · <strong>Category:</strong> Rule Evolution · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/patch-genealogy">https://ludologium.com/patch-genealogy</a></p>
<table><tbody><tr><td><strong>Primary Evidence</strong></td><td>Published Developer Patch Notes &amp; Versioned Changelogs</td></tr><tr><td><strong>Causal Pattern</strong></td><td>Local Parameter Edit → Second-Order Ecosystem Shift</td></tr><tr><td><strong>Epistemic Boundary</strong></td><td>Documented rule deltas vs. modeled meta consequences</td></tr></tbody></table>
<p>Longitudinal dossier following rule perturbations and second-order incentive shifts across live competitive ecosystems.</p>
<p>In tightly coupled competitive games, there is no such thing as an isolated balance tweak: shaving 50 gold off an early utility item or adding two frames of recovery to a defensive poke alters objective timing, map-control economy, and counter-pick viability three layers downstream.</p>
<p>The Patch Genealogy dossier (/patch-genealogy) maps versioned rule mutations as directed causal graphs so designers can trace second- and third-order incentive cascades.</p>
<p><a href="https://ludologium.com/patch-genealogy">Open interactive laboratory &amp; primary dataset at https://ludologium.com/patch-genealogy →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-DOSSIER-03: USPTO Game &amp; Controller Patent Blueprint Atlas (1904–2024)</title>
      <link>https://ludologium.com/patents</link>
      <guid isPermaLink="true">https://ludologium.com/patents</guid>
      <pubDate>Wed, 09 Sep 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Field Dossier</category>
      <category>Intellectual Property &amp; Hardware</category>
      <description>From Lizzie Magie’s 1904 Game-Board specification and Nintendo’s D-pad cross to modern haptics and camera systems — Documentary dossier indexing landmark mechanical and hardware patents from the U.S. Patent and Trademark Office.</description>
      <content:encoded><![CDATA[<p><strong>LUD-DOSSIER-03 · Field Dossier · [PRIMARY PATENT RECORD]</strong> — <em>From Lizzie Magie’s 1904 Game-Board specification and Nintendo’s D-pad cross to modern haptics and camera systems</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-09-09 · <strong>Category:</strong> Intellectual Property &amp; Hardware · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/patents">https://ludologium.com/patents</a></p>
<table><tbody><tr><td><strong>Primary Archive</strong></td><td>U.S. Patent and Trademark Office (USPTO) Grants</td></tr><tr><td><strong>Chronological Span</strong></td><td>1904 (US748626A) through Modern Spatial/Haptic Filings</td></tr><tr><td><strong>Focus Domains</strong></td><td>Board Topologies · D-Pad Input · Z-Targeting · Trading Cards</td></tr></tbody></table>
<p>Documentary dossier indexing landmark mechanical and hardware patents from the U.S. Patent and Trademark Office.</p>
<p>Patent filings preserve mechanical history with an candor marketing copy never matches: inventors must specify physical linkages, state transitions, and claim boundaries unambiguously.</p>
<p>The USPTO Game &amp; Controller Patent Atlas (/patents) pairs primary patent numbers, filing dates, and claim summaries—from Gunpei Yokoi’s cross-shaped directional pad (US4687200A) and Trading Card Game method claims to camera-lock and Nemesis-style hierarchy patents—while noting legal expiration and scope limits.</p>
<p><a href="https://ludologium.com/patents">Open interactive laboratory &amp; primary dataset at https://ludologium.com/patents →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-DOSSIER-04: Software Preservation Framework &amp; Hardware Decay Radar</title>
      <link>https://ludologium.com/preservation</link>
      <guid isPermaLink="true">https://ludologium.com/preservation</guid>
      <pubDate>Thu, 03 Sep 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Field Dossier</category>
      <category>Digital Conservation</category>
      <description>Bit rot, proprietary optical media degradation, FPGA vs. software emulation accuracy, and Library of Congress stewardship — Conservation briefing evaluating physical cartridge/disc lifespans alongside cycle-accurate emulation trade-offs.</description>
      <content:encoded><![CDATA[<p><strong>LUD-DOSSIER-04 · Field Dossier · [ARCHIVAL GOVERNANCE]</strong> — <em>Bit rot, proprietary optical media degradation, FPGA vs. software emulation accuracy, and Library of Congress stewardship</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-09-03 · <strong>Category:</strong> Digital Conservation · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/preservation">https://ludologium.com/preservation</a></p>
<table><tbody><tr><td><strong>Physical Hazards</strong></td><td>EPROM Charge Leakage · Battery-Backed SRAM Failure · Disc Rot</td></tr><tr><td><strong>Preservation Tiers</strong></td><td>Original Silicon · Cycle-Accurate FPGA · High-Level Emulation</td></tr><tr><td><strong>Institutional Context</strong></td><td>Video Game History Foundation &amp; Library of Congress DMCA Exemptions</td></tr></tbody></table>
<p>Conservation briefing evaluating physical cartridge/disc lifespans alongside cycle-accurate emulation trade-offs.</p>
<p>Unlike printed rulebooks or carved stone mancala boards, commercial video games depend on decaying storage chemistry, custom silicon timing quirks, and remote authentication servers that publishers routinely sunset.</p>
<p>The Software Preservation dossier (/preservation) audits physical media failure modes alongside the engineering trade-offs between high-level software emulation, cycle-accurate interpreters, and hardware FPGA reconstruction.</p>
<p><a href="https://ludologium.com/preservation">Open interactive laboratory &amp; primary dataset at https://ludologium.com/preservation →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-DOSSIER-05: The Business of Play: SEC EDGAR 10-K Graph &amp; Studio Consolidation</title>
      <link>https://ludologium.com/business</link>
      <guid isPermaLink="true">https://ludologium.com/business</guid>
      <pubDate>Thu, 27 Aug 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Field Dossier</category>
      <category>Industry Economics</category>
      <description>Public publisher R&amp;D intensity, live-service recurring revenue mix, and M&amp;A ownership networks — Financial structure dossier built from public SEC EDGAR XBRL disclosures and documented studio acquisitions.</description>
      <content:encoded><![CDATA[<p><strong>LUD-DOSSIER-05 · Field Dossier · [SEC XBRL FILING]</strong> — <em>Public publisher R&amp;D intensity, live-service recurring revenue mix, and M&amp;A ownership networks</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-08-27 · <strong>Category:</strong> Industry Economics · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/business">https://ludologium.com/business</a></p>
<table><tbody><tr><td><strong>Primary Source</strong></td><td>U.S. SEC EDGAR 10-K / 20-F Filings &amp; XBRL Disclosures</td></tr><tr><td><strong>Structural Metrics</strong></td><td>R&amp;D-to-Revenue Ratio · Live-Service Mix · M&amp;A Lineage</td></tr><tr><td><strong>Epistemic Note</strong></td><td>Audited accounting disclosures, not investment advice</td></tr></tbody></table>
<p>Financial structure dossier built from public SEC EDGAR XBRL disclosures and documented studio acquisitions.</p>
<p>Design choices in contemporary games—battle passes, annualized franchises, engine standardization, and risk aversion in AAA budgets—cannot be understood apart from balance-sheet structure.</p>
<p>Drawing on public SEC EDGAR filings (/business), this dossier maps how rising development capitalization, recurring digital storefront margins, and multi-decade studio acquisitions reshaped what kinds of rule systems get funded.</p>
<p><a href="https://ludologium.com/business">Open interactive laboratory &amp; primary dataset at https://ludologium.com/business →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-SPEC-01: The Table Through Time: Historical Board &amp; Rule Specimens (1700–2000)</title>
      <link>https://ludologium.com/archaeology</link>
      <guid isPermaLink="true">https://ludologium.com/archaeology</guid>
      <pubDate>Fri, 21 Aug 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Specimen Study</category>
      <category>Material Archaeology</category>
      <description>Object-level catalog drawing on Smithsonian, British Museum, and Library of Congress open-access game collections — Specimen study examining physical board topologies, dice materials, and moralized race-game prints across three centuries.</description>
      <content:encoded><![CDATA[<p><strong>LUD-SPEC-01 · Specimen Study · [MUSEUM &amp; LOC RECORD]</strong> — <em>Object-level catalog drawing on Smithsonian, British Museum, and Library of Congress open-access game collections</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-08-21 · <strong>Category:</strong> Material Archaeology · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/archaeology">https://ludologium.com/archaeology</a></p>
<table><tbody><tr><td><strong>Collection Sources</strong></td><td>British Museum · Smithsonian · Library of Congress</td></tr><tr><td><strong>Topological Classes</strong></td><td>Spiral Race Boards · Mancala Pit Arrays · Lattice War Games</td></tr><tr><td><strong>Material Media</strong></td><td>Chromolithographed Linen · Engraved Copperplate · Bone/Ivory Dice</td></tr></tbody></table>
<p>Specimen study examining physical board topologies, dice materials, and moralized race-game prints across three centuries.</p>
<p>Long before software engines, board geometry encoded moral and civic arguments directly into paper, wood, and bone: eighteenth-century Goose variants turned life stages into pure Markov roll-and-move spirals, while asymmetric capture boards modeled siege and encirclement.</p>
<p>The Table Through Time (/archaeology) catalogs historical specimens with accession cross-references, separating documented physical dimensions from modern reconstructions of incomplete ancient rulesets.</p>
<p><a href="https://ludologium.com/archaeology">Open interactive laboratory &amp; primary dataset at https://ludologium.com/archaeology →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-SPEC-02: Rulebook Edition Diff Engine: Clause-by-Clause Incentive Deltas</title>
      <link>https://ludologium.com/rule-diff</link>
      <guid isPermaLink="true">https://ludologium.com/rule-diff</guid>
      <pubDate>Sat, 15 Aug 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Specimen Study</category>
      <category>Textual Ludology</category>
      <description>Inspecting exact wording revisions between historical and modern rulebook printings — Side-by-side textual and mechanical comparison showing how minor rulebook edits reshape edge cases and dominant play.</description>
      <content:encoded><![CDATA[<p><strong>LUD-SPEC-02 · Specimen Study · [EDITION COMPARISON]</strong> — <em>Inspecting exact wording revisions between historical and modern rulebook printings</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-08-15 · <strong>Category:</strong> Textual Ludology · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/rule-diff">https://ludologium.com/rule-diff</a></p>
<table><tbody><tr><td><strong>Method</strong></td><td>Clause-Level Textual Diff + State-Machine Consequence Note</td></tr><tr><td><strong>Focus</strong></td><td>Tie-Breakers · Turn-Order Compensation · Resource Caps</td></tr><tr><td><strong>Companion Tool</strong></td><td>Interactive Rule Diff Viewer at /rule-diff</td></tr></tbody></table>
<p>Side-by-side textual and mechanical comparison showing how minor rulebook edits reshape edge cases and dominant play.</p>
<p>Treat a tabletop rulebook like legal or software source code and edition printings become fascinating commit logs: changing 'may' to 'must' on a single trigger clause or adjusting starting-player compensation can invert an entire tournament strategy space.</p>
<p>The Rulebook Edition Diff study (/rule-diff) aligns historical and revised clauses side by side to annotate the exact state-space bug each revision closed.</p>
<p><a href="https://ludologium.com/rule-diff">Open interactive laboratory &amp; primary dataset at https://ludologium.com/rule-diff →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-SPEC-03: Convergent Evolution Matrix: Independent Mechanical Homologies</title>
      <link>https://ludologium.com/convergent-evolution</link>
      <guid isPermaLink="true">https://ludologium.com/convergent-evolution</guid>
      <pubDate>Sat, 08 Aug 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Specimen Study</category>
      <category>Comparative Morphology</category>
      <description>Separating documented lineage (INFLUENCED_BY) from independent discovery of equivalent state transitions (MECHANICALLY_SIMILAR_TO) — Comparative specimen study distinguishing historical borrowing from structural convergence under shared physical constraints.</description>
      <content:encoded><![CDATA[<p><strong>LUD-SPEC-03 · Specimen Study · [STRUCTURAL HOMOLOGY]</strong> — <em>Separating documented lineage (INFLUENCED_BY) from independent discovery of equivalent state transitions (MECHANICALLY_SIMILAR_TO)</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-08-08 · <strong>Category:</strong> Comparative Morphology · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/convergent-evolution">https://ludologium.com/convergent-evolution</a></p>
<table><tbody><tr><td><strong>Graph Edge Split</strong></td><td>INFLUENCED_BY (documented) vs. MECHANICALLY_SIMILAR_TO</td></tr><tr><td><strong>Analogy</strong></td><td>Biological Homology (shared ancestor) vs. Homoplasy (convergence)</td></tr><tr><td><strong>Examples</strong></td><td>Drafting Loops · Fog-of-War Information Hiding · Push-Your-Luck</td></tr></tbody></table>
<p>Comparative specimen study distinguishing historical borrowing from structural convergence under shared physical constraints.</p>
<p>Game historians and players frequently assume that if Game B shares a clever resource-decay mechanic with earlier Game A, B must have copied A. Yet finite human memory, six-sided dice, and 60-minute session budgets push independent designers into remarkably similar mathematical solutions.</p>
<p>Ludologium’s Convergent Evolution Matrix (/convergent-evolution) enforces a strict graph-edge distinction: INFLUENCED_BY requires documentary citation (designer interviews, patents, or rule credits), while MECHANICALLY_SIMILAR_TO records pure structural isomorphism.</p>
<p><a href="https://ludologium.com/convergent-evolution">Open interactive laboratory &amp; primary dataset at https://ludologium.com/convergent-evolution →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
    <item>
      <title>LUD-SPEC-04: Comparative Chess Observatory &amp; FIDE Rating Distributions</title>
      <link>https://ludologium.com/chess-observatory</link>
      <guid isPermaLink="true">https://ludologium.com/chess-observatory</guid>
      <pubDate>Sat, 01 Aug 2026 12:00:00 GMT</pubDate>
      <dc:creator>Evelyna Bellamy</dc:creator>
      <category>Specimen Study</category>
      <category>Rating Systems &amp; Tree Search</category>
      <description>Classical, Rapid, and Blitz rating densities alongside an interactive grandmaster opening and move oracle — Deep specimen study of modern chess rating ecosystems paired with legal move-tree inspection.</description>
      <content:encoded><![CDATA[<p><strong>LUD-SPEC-04 · Specimen Study · [FIDE RATING RECORD]</strong> — <em>Classical, Rapid, and Blitz rating densities alongside an interactive grandmaster opening and move oracle</em></p>
<p><strong>Author:</strong> <a href="https://evelynabellamy.com">Evelyna Bellamy</a> · <strong>Date:</strong> 2026-08-01 · <strong>Category:</strong> Rating Systems &amp; Tree Search · <strong>Canonical Edition:</strong> <a href="https://ludologium.com/chess-observatory">https://ludologium.com/chess-observatory</a></p>
<table><tbody><tr><td><strong>Rating Pools</strong></td><td>FIDE Classical · Rapid · Blitz Elo Distributions</td></tr><tr><td><strong>Formal Properties</strong></td><td>Zero-Sum · Perfect Information · Deterministic Tree</td></tr><tr><td><strong>Interactive Companion</strong></td><td>Chess Simulator &amp; Opening Oracle (/chess-simulator)</td></tr></tbody></table>
<p>Deep specimen study of modern chess rating ecosystems paired with legal move-tree inspection.</p>
<p>Arpad Elo’s rating model turns millions of pairwise tournament outcomes into a calibrated probabilistic scale—yet rating pools drift, deflate, or compress differently across Classical, Rapid, and Blitz time controls.</p>
<p>The Comparative Chess Observatory (/chess-observatory) pairs FIDE rating distribution geometry with an interactive legal-move and opening tree inspector.</p>
<p><a href="https://ludologium.com/chess-observatory">Open interactive laboratory &amp; primary dataset at https://ludologium.com/chess-observatory →</a> · <a href="https://ludologium.com/research">Browse all Ludologium research registers →</a></p>]]></content:encoded>
    </item>
  </channel>
</rss>
