<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Daily Games Page</title>
    <description>The latest articles on DEV Community by Daily Games Page (@dailygamespage).</description>
    <link>https://dev.to/dailygamespage</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4239164%2F8f896fb5-abd7-44e0-afad-61aba936f15b.png</url>
      <title>DEV Community: Daily Games Page</title>
      <link>https://dev.to/dailygamespage</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/dailygamespage"/>
    <language>en</language>
    <item>
      <title>Building a Daily Word Ladder: BFS, Word Lists, and Picking Fair Puzzles</title>
      <dc:creator>Daily Games Page</dc:creator>
      <pubDate>Wed, 11 Nov 2026 13:21:56 +0000</pubDate>
      <link>https://dev.to/dailygamespage/building-a-daily-word-ladder-bfs-word-lists-and-picking-fair-puzzles-50p1</link>
      <guid>https://dev.to/dailygamespage/building-a-daily-word-ladder-bfs-word-lists-and-picking-fair-puzzles-50p1</guid>
      <description>&lt;p&gt;A word ladder asks you to turn one word into another by changing a single letter at a time, with every step being a real word. COLD → CORD → CARD → WARD → WARM. It's a lovely little puzzle, and it turns out to be a nice small graph problem too.&lt;/p&gt;

&lt;h2&gt;
  
  
  The graph
&lt;/h2&gt;

&lt;p&gt;Treat every word of a given length as a node, and connect two words if they differ by exactly one letter. A ladder is then just a path, and the &lt;em&gt;shortest&lt;/em&gt; ladder is a breadth-first search.&lt;/p&gt;

&lt;p&gt;The naive way to build edges compares every pair of words, which is O(n²). A much faster trick is to bucket words by wildcard patterns: &lt;code&gt;cold&lt;/code&gt; goes into &lt;code&gt;_old&lt;/code&gt;, &lt;code&gt;c_ld&lt;/code&gt;, &lt;code&gt;co_d&lt;/code&gt; and &lt;code&gt;col_&lt;/code&gt;. Any two words sharing a bucket are neighbours.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="n"&gt;buckets&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nb"&gt;Map&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="n"&gt;w&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="n"&gt;words&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;w&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;length&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="n"&gt;key&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;w&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;slice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="s2"&gt;"_"&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;w&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;slice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="o"&gt;!&lt;/span&gt;&lt;span class="n"&gt;buckets&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;has&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;key&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="n"&gt;buckets&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;set&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;key&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="n"&gt;buckets&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;get&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;key&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;push&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;w&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  The word list matters more than the algorithm
&lt;/h2&gt;

&lt;p&gt;The hardest part wasn't BFS, it was the dictionary. A full Scrabble list produces "valid" ladders through words nobody has heard of, which feels unfair. We ended up using two lists: a large one to &lt;em&gt;accept&lt;/em&gt; a player's step, and a smaller common-words list to &lt;em&gt;generate&lt;/em&gt; puzzles, so the intended solution only uses words people actually know.&lt;/p&gt;

&lt;h2&gt;
  
  
  Picking a fair daily puzzle
&lt;/h2&gt;

&lt;p&gt;For each candidate start/end pair we compute the shortest path length and how many distinct shortest paths exist. Puzzles with a length of 4–6 steps and a few alternative routes felt best: too few routes and it becomes a guessing game, too many and it's trivial.&lt;/p&gt;

&lt;h2&gt;
  
  
  Try it
&lt;/h2&gt;

&lt;p&gt;The result is Rungs, a free daily word ladder on &lt;a href="https://dailygamespage.com/" rel="noopener noreferrer"&gt;Daily Games Page&lt;/a&gt;, with an unlimited mode and a 90-second climb. No account, no app. I'd love to hear how others handle dictionary quality in word games.&lt;/p&gt;

</description>
      <category>gamedev</category>
      <category>javascript</category>
      <category>algorithms</category>
      <category>puzzle</category>
    </item>
  </channel>
</rss>
