<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>The Domino Problem</title>
    <link>https://omegasyntax.com/domino/</link>
    <description>Recent content on The Domino Problem</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Sat, 28 Feb 2026 21:00:00 -0500</lastBuildDate>
    <atom:link href="https://omegasyntax.com/domino/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Chapter 1: The Trap</title>
      <link>https://omegasyntax.com/domino/posts/chapter-1/</link>
      <pubDate>Sat, 28 Feb 2026 10:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-1/</guid>
      <description>In 1994, a Russian Olympiad problem asked to tile a grid with dominoes&amp;hellip;</description>
    </item>
    <item>
      <title>Chapter 2: The Jagged Edge</title>
      <link>https://omegasyntax.com/domino/posts/chapter-2/</link>
      <pubDate>Sat, 28 Feb 2026 11:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-2/</guid>
      <description>The 3xM board destroys the simple Fibonacci illusion. To solve it, we must embrace&amp;hellip;</description>
    </item>
    <item>
      <title>Chapter 3: The Matrix Cheat Code</title>
      <link>https://omegasyntax.com/domino/posts/chapter-3/</link>
      <pubDate>Sat, 28 Feb 2026 12:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-3/</guid>
      <description>To tile a room with a billion columns, we have to abandon the standard &amp;lsquo;for&amp;rsquo; loop. By mapping edge transitions into a Transfer Matrix, we unlock the cheat code of logarithmic time.</description>
    </item>
    <item>
      <title>Chapter 4: The Berlekamp-Massey Heist</title>
      <link>https://omegasyntax.com/domino/posts/chapter-4/</link>
      <pubDate>Sat, 28 Feb 2026 13:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-4/</guid>
      <description>When a 6563x6563 transfer matrix threatens to melt our CPU, we abandon linear algebra entirely. By reverse-engineering the sequence, we pull off the ultimate algorithmic heist.</description>
    </item>
    <item>
      <title>Chapter 5: The Kasteleyn Shock</title>
      <link>https://omegasyntax.com/domino/posts/chapter-5/</link>
      <pubDate>Sat, 28 Feb 2026 14:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-5/</guid>
      <description>When computer science fails to tile a 64x64 board, we must abandon the grid entirely. Enter graph theory, adjacency matrices, and a formula that looks like it belongs in quantum physics.</description>
    </item>
    <item>
      <title>Chapter 6: The Anatomy of the Matrix</title>
      <link>https://omegasyntax.com/domino/posts/chapter-6/</link>
      <pubDate>Sat, 28 Feb 2026 15:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-6/</guid>
      <description>To understand Pieter Kasteleyn&amp;rsquo;s formula, we must dissect the adjacency matrix. We reveal how a 2D checkerboard is just two 1D strings crossing, and exactly how π and trigonometry enter the equation.</description>
    </item>
    <item>
      <title>Chapter 7: The Floating-Point Trap</title>
      <link>https://omegasyntax.com/domino/posts/chapter-7/</link>
      <pubDate>Sat, 28 Feb 2026 16:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-7/</guid>
      <description>Kasteleyn’s formula is a mathematical masterpiece. But if you try to code it, you will immediately crash into the physical limitations of computer hardware. Plus, a detour into the thermodynamic limit.</description>
    </item>
    <item>
      <title>Chapter 8: Banishing Floats</title>
      <link>https://omegasyntax.com/domino/posts/chapter-8/</link>
      <pubDate>Sat, 28 Feb 2026 17:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-8/</guid>
      <description>To calculate a massive trigonometric product without losing precision, we have to stop using numbers and start using algebra. Enter Roots of Unity, Cyclotomic Polynomials, and the limits of RAM.</description>
    </item>
    <item>
      <title>Chapter 9: The Number Theory Cheat Code</title>
      <link>https://omegasyntax.com/domino/posts/chapter-9/</link>
      <pubDate>Sat, 28 Feb 2026 18:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-9/</guid>
      <description>When exact polynomials devour your RAM, you have to change the universe the math operates in. We introduce Finite Fields, 64-bit primes, and the ultimate hardware-sympathetic loop.</description>
    </item>
    <item>
      <title>Chapter 10: Stitching the Multiverse</title>
      <link>https://omegasyntax.com/domino/posts/chapter-10/</link>
      <pubDate>Sat, 28 Feb 2026 19:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-10/</guid>
      <description>Our finite field engine is blazing fast, but it only gives us a tiny fragment of the answer. By using the Chinese Remainder Theorem and maxing out our CPU cores, we assemble the final, massive integer.</description>
    </item>
    <item>
      <title>Chapter 11: The Russian Textbook Anomaly</title>
      <link>https://omegasyntax.com/domino/posts/chapter-11/</link>
      <pubDate>Sat, 28 Feb 2026 20:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-11/</guid>
      <description>Just when I thought the engine was finished, a friend sent me a snippet from a Russian physics textbook. It forced a complete rewrite, dropping the time complexity to O(K log N) and obliterating our benchmarks.</description>
    </item>
    <item>
      <title>Chapter 12: The Final Tally</title>
      <link>https://omegasyntax.com/domino/posts/chapter-12/</link>
      <pubDate>Sat, 28 Feb 2026 21:00:00 -0500</pubDate>
      <guid>https://omegasyntax.com/domino/posts/chapter-12/</guid>
      <description>From a 14-year-old&amp;rsquo;s Turbo Pascal script on an 80286 to a multi-core supercomputing engine. We review the math, the code, and the ultimate lesson: hardware gets faster, but mathematics conquers.</description>
    </item>
  </channel>
</rss>
