<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Information Camouflage</title>
    <link>https://bruceediger.com/</link>
    <description>Recent content on Information Camouflage</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <atom:link href="https://bruceediger.com/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Wordle Feb 17, 2024</title>
      <link>https://bruceediger.com/posts/wordle-2024-02-17/</link>
      <pubDate>Thu, 22 Feb 2024 06:48:10 -0700</pubDate>
      <guid>https://bruceediger.com/posts/wordle-2024-02-17/</guid>
      <description>&lt;p&gt;I felt pretty happy getting this wordle in 4 guesses, as you can see.&#xA;But how good was my 4th guess?&lt;/p&gt;</description>
    </item>
    <item>
      <title>Optimal Smurfing in English and Greek</title>
      <link>https://bruceediger.com/posts/optimal-smurfing/</link>
      <pubDate>Thu, 22 Feb 2024 06:32:30 -0700</pubDate>
      <guid>https://bruceediger.com/posts/optimal-smurfing/</guid>
      <description>&lt;p&gt;&lt;em&gt;Optimal Smurfing in English and Greek&lt;/em&gt;&#xA;Catherine Chatzopoulos, 2008,&#xA;University of Chicago, Aristotle University of Thessaloniki&lt;/p&gt;&#xA;&lt;p&gt;I found a &lt;a href=&#34;https://www.academia.edu/es/1135038/Optimal_smurfing_in_English_and_Greek&#34;&gt;PDF version&lt;/a&gt;&#xA;of the paper.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Programming Puzzle Gone Wrong</title>
      <link>https://bruceediger.com/posts/count-binary-tree/</link>
      <pubDate>Sun, 18 Feb 2024 13:40:00 -0700</pubDate>
      <guid>https://bruceediger.com/posts/count-binary-tree/</guid>
      <description>&lt;p&gt;A programming interview question from the&#xA;&lt;a href=&#34;https://bruceediger.com/posts/daily-coding-problem/&#34;&gt;Daily Coding Problem&lt;/a&gt;&#xA;email list.&#xA;Here&amp;rsquo;s a non-hand-wavy explanation of&#xA;a way to solve this problem.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Daily Coding Problem: Problem #736 [Easy]&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;Given a complete binary tree,&#xA;count the number of nodes in faster than O(n) time.&#xA;Recall that a complete binary tree has every level filled except the last,&#xA;and the nodes in the last level are filled starting from the left.&#xA;&amp;ldquo;Complete&amp;rdquo; means: every level, except possibly the last,&#xA;is completely filled,&#xA;and all nodes in the last level are as far left as possible.&#xA;It can have between 1 and 2h nodes at the last level h.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Reptile Gardens</title>
      <link>https://bruceediger.com/posts/reptile-garden/</link>
      <pubDate>Sun, 04 Feb 2024 11:04:15 -0700</pubDate>
      <guid>https://bruceediger.com/posts/reptile-garden/</guid>
      <description>&lt;p&gt;If you&amp;rsquo;re ever near &lt;a href=&#34;https://www.rcgov.org/&#34;&gt;Rapid City, SD&lt;/a&gt;,&#xA;you should visit the &lt;a href=&#34;https://www.reptilegardens.com/&#34;&gt;Reptile Gardens&lt;/a&gt;.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Wordle, February 3, 2024</title>
      <link>https://bruceediger.com/posts/wordle-2024-02-03/</link>
      <pubDate>Sat, 03 Feb 2024 18:06:16 -0700</pubDate>
      <guid>https://bruceediger.com/posts/wordle-2024-02-03/</guid>
      <description>&lt;p&gt;I solved Wordle 959 without help, my streak is now 97.&#xA;I see another opportunity to write a large regular expression&#xA;that could get the answer.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Count number of heaps coding problem</title>
      <link>https://bruceediger.com/posts/heap-counter/</link>
      <pubDate>Thu, 01 Feb 2024 13:46:23 -0700</pubDate>
      <guid>https://bruceediger.com/posts/heap-counter/</guid>
      <description>&lt;p&gt;Another programming interview question from the&#xA;&lt;a href=&#34;https://bruceediger.com/posts/daily-coding-problem/&#34;&gt;Daily Coding Problem&lt;/a&gt;&#xA;email list.&#xA;I received it as #1608.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Daily Coding Problem: Problem #1608 [Medium]&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This problem was asked by Microsoft.&lt;/p&gt;&#xA;&lt;p&gt;Write a program to determine how many distinct ways&#xA;there are to create a max heap from a list of &lt;code&gt;N&lt;/code&gt; given integers.&lt;/p&gt;&#xA;&lt;p&gt;For example,&#xA;if &lt;code&gt;N = 3&lt;/code&gt;,&#xA;and our integers are &lt;code&gt;[1, 2, 3]&lt;/code&gt;,&#xA;there are two ways, shown below.&lt;/p&gt;&#xA;&lt;pre tabindex=&#34;0&#34;&gt;&lt;code&gt;  3      3&#xA; / \    / \&#xA;1   2  2   1&#xA;&lt;/code&gt;&lt;/pre&gt;&lt;p&gt;&lt;a href=&#34;https://github.com/bediger4000/heapcount&#34;&gt;Repo&lt;/a&gt; for my code.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Starship Troopers Fanfic Idea</title>
      <link>https://bruceediger.com/posts/starship-troopers-fanfic/</link>
      <pubDate>Wed, 31 Jan 2024 17:18:15 -0700</pubDate>
      <guid>https://bruceediger.com/posts/starship-troopers-fanfic/</guid>
      <description>&lt;p&gt;I&amp;rsquo;ve got an idea for &lt;a href=&#34;https://bruceediger.com/tags/starship-troopers/&#34;&gt;Starship Troopers&lt;/a&gt;&#xA;fan fiction.&#xA;I&amp;rsquo;m giving it away, for free!&#xA;You can have it!&lt;/p&gt;</description>
    </item>
    <item>
      <title>Wordle, January 30, 2024</title>
      <link>https://bruceediger.com/posts/wordle-2024-01-30/</link>
      <pubDate>Wed, 31 Jan 2024 16:25:52 -0700</pubDate>
      <guid>https://bruceediger.com/posts/wordle-2024-01-30/</guid>
      <description>&lt;p&gt;&lt;img src=&#34;https://bruceediger.com/images/wordle_955_grid_30.png&#34; alt=&#34;wordle grid 955&#34;&gt;&lt;/p&gt;&#xA;&lt;p&gt;I solved 955 without any computerized help,&#xA;but I think my second-to-last guess can generate an interesting&#xA;regular expression.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Character flipping programming interview problem</title>
      <link>https://bruceediger.com/posts/xyxxxyxyy/</link>
      <pubDate>Mon, 15 Jan 2024 22:48:38 -0700</pubDate>
      <guid>https://bruceediger.com/posts/xyxxxyxyy/</guid>
      <description>&lt;p&gt;Programming interview question from the&#xA;&lt;a href=&#34;https://bruceediger.com/posts/daily-coding-problem/&#34;&gt;Daily Coding Problem&lt;/a&gt;&#xA;email list.&#xA;I have it as #1602, but other folks have it as #331 from 2020.&#xA;I guess I missed it back then.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Daily Coding Problem: Problem #1602 [Medium]&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;This problem was asked by LinkedIn.&lt;/p&gt;&#xA;&lt;p&gt;You are given a string consisting of the letters &lt;code&gt;x&lt;/code&gt; and &lt;code&gt;y&lt;/code&gt;,&#xA;such as &lt;code&gt;xyxxxyxyy&lt;/code&gt;.&#xA;In addition,&#xA;you have an operation called &lt;code&gt;flip&lt;/code&gt;,&#xA;which changes a single &lt;code&gt;x&lt;/code&gt; to &lt;code&gt;y&lt;/code&gt; or vice versa.&lt;/p&gt;&#xA;&lt;p&gt;Determine how many times you would need to apply this operation to ensure&#xA;that all &lt;code&gt;x&lt;/code&gt;&amp;rsquo;s come before all &lt;code&gt;y&lt;/code&gt;&amp;rsquo;s.&#xA;In the preceding example,&#xA;it suffices to flip the second and sixth characters,&#xA;so you should return 2.&lt;/p&gt;&#xA;&lt;hr&gt;&#xA;&lt;p&gt;&lt;a href=&#34;https://github.com/bediger4000/xyxxxyxyy&#34;&gt;Repo&lt;/a&gt; for code.&lt;/p&gt;</description>
    </item>
    <item>
      <title>How Steam Locomotives Work</title>
      <link>https://bruceediger.com/posts/how-steam-locomotives-work/</link>
      <pubDate>Sat, 13 Jan 2024 19:27:25 -0700</pubDate>
      <guid>https://bruceediger.com/posts/how-steam-locomotives-work/</guid>
      <description>&lt;p&gt;&lt;em&gt;How Steam Locomotives Work&lt;/em&gt; Paperback, March 1, 2022&#xA;by Brian Solomon, ISBN 9781627008808&lt;/p&gt;&#xA;&lt;p&gt;Not to be confused with&#xA;&lt;a href=&#34;https://bruceediger.com/posts/steam-locomotives/&#34;&gt;How Steam Locomotives Really Work&lt;/a&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>6 in 1 Screwdrivers</title>
      <link>https://bruceediger.com/posts/screwdrivers/</link>
      <pubDate>Sat, 13 Jan 2024 18:39:06 -0700</pubDate>
      <guid>https://bruceediger.com/posts/screwdrivers/</guid>
      <description>&lt;p&gt;Do yourself a favor: get a 6-in-1 screwdriver.&#xA;It will cover 90% of what you need screwdrivers for.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Dobby&#39;s First Birthday!</title>
      <link>https://bruceediger.com/posts/dobbys-birthday/</link>
      <pubDate>Sat, 13 Jan 2024 18:04:37 -0700</pubDate>
      <guid>https://bruceediger.com/posts/dobbys-birthday/</guid>
      <description>&lt;p&gt;I got my pet Roomba, &lt;a href=&#34;https://bruceediger.com/posts/new-pet/&#34;&gt;Dobby&lt;/a&gt;,&#xA;almost a year ago!&lt;/p&gt;&#xA;&lt;p&gt;Dobby&amp;rsquo;s maker, iRobot, was considerate enough to remind me&#xA;to &lt;em&gt;treat&lt;/em&gt; &lt;strong&gt;him&lt;/strong&gt; to new parts!&lt;/p&gt;</description>
    </item>
    <item>
      <title>Knowledge Fight Podcast</title>
      <link>https://bruceediger.com/posts/knowledge-fight--podcast/</link>
      <pubDate>Sat, 13 Jan 2024 13:45:43 -0700</pubDate>
      <guid>https://bruceediger.com/posts/knowledge-fight--podcast/</guid>
      <description>&lt;p&gt;Red Alert&amp;hellip;&lt;br/&gt;&#xA;Red Alert, Red Alert!&lt;/p&gt;&#xA;&lt;p&gt;I recommend listening to a few episodes of the&#xA;&lt;a href=&#34;https://knowledgefight.com/&#34;&gt;Knowledge Fight Podcast&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;p&gt;You will learn more than you ever wanted to know about&#xA;infamous conspiracy theorist &lt;a href=&#34;https://en.wikipedia.org/wiki/Alex_Jones&#34;&gt;Alex Jones&lt;/a&gt;,&#xA;and maybe have a little fun.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Was There a Cambrian Explosion on Land?</title>
      <link>https://bruceediger.com/posts/cambrian-explosion-on-land/</link>
      <pubDate>Fri, 12 Jan 2024 21:00:04 -0700</pubDate>
      <guid>https://bruceediger.com/posts/cambrian-explosion-on-land/</guid>
      <description>&lt;p&gt;A paper worth reading:&lt;/p&gt;&#xA;&lt;p&gt;Tihelka, E.; Howard, R.J.;&#xA;Cai, C.; Lozano-Fernandez, J.&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;Was There a Cambrian Explosion on&#xA;Land? The Case of Arthropod&#xA;Terrestrialization&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;Biology 2022, 11, 1516.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&#34;https://doi.org/10.3390/biology11101516&#34;&gt;https://doi.org/10.3390/biology11101516&lt;/a&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>A Smurf Based Approach to Placeholder Expressions</title>
      <link>https://bruceediger.com/posts/smurf-based-approach/</link>
      <pubDate>Sat, 06 Jan 2024 17:57:47 -0700</pubDate>
      <guid>https://bruceediger.com/posts/smurf-based-approach/</guid>
      <description>&lt;p&gt;I read an interesting paper:&lt;/p&gt;&#xA;&lt;p&gt;&lt;em&gt;A Smurf-based Approach to Placeholder Expressions&lt;/em&gt;,&#xA;July 2021, by Manfred Sailer and Annika Dörner&lt;/p&gt;&#xA;&lt;p&gt;which apparently appeared in:&lt;/p&gt;&#xA;&lt;p&gt;Proceedings of the 27th International Conference on Head-Driven Phrase Structure Grammar,&#xA;Online (Berlin/Seattle), 2020.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Fortune Cookies, December 2023</title>
      <link>https://bruceediger.com/posts/fortune-cookies-3/</link>
      <pubDate>Thu, 04 Jan 2024 21:22:53 -0700</pubDate>
      <guid>https://bruceediger.com/posts/fortune-cookies-3/</guid>
      <description>&lt;p&gt;Got these fortunes the last time I picked up chinese food&#xA;at the local strip mall.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Peppernuts Haul 2023</title>
      <link>https://bruceediger.com/posts/peppernuts-2023/</link>
      <pubDate>Thu, 04 Jan 2024 20:35:43 -0700</pubDate>
      <guid>https://bruceediger.com/posts/peppernuts-2023/</guid>
      <description>&lt;p&gt;Quite a haul this year.&#xA;My son and I made a full, 6-7 cup of flour recipe.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Ammonites</title>
      <link>https://bruceediger.com/posts/ammonites/</link>
      <pubDate>Tue, 02 Jan 2024 21:32:57 -0700</pubDate>
      <guid>https://bruceediger.com/posts/ammonites/</guid>
      <description>&lt;p&gt;&lt;em&gt;Ammonites&lt;/em&gt;, Neal Monks and Philip Palmer,&#xA;2002, Smithsonian Institution Press&lt;br/&gt;&#xA;ISBN 1-58834-024-4&lt;/p&gt;</description>
    </item>
    <item>
      <title>Ghost of the Hardy Boys</title>
      <link>https://bruceediger.com/posts/ghost-of-hardy-boys/</link>
      <pubDate>Mon, 01 Jan 2024 15:30:59 -0700</pubDate>
      <guid>https://bruceediger.com/posts/ghost-of-hardy-boys/</guid>
      <description>&lt;p&gt;&lt;em&gt;Ghost of the Hardy Boys&lt;/em&gt;, by Leslie MacFarlane, 1976,&#xA;ISBN 9781567927177.&#xA;I have a copy of the 2022 GODINE edition.&#xA;The cover is by Dan Grissom.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Across the Space Frontier - circumlunar trip</title>
      <link>https://bruceediger.com/posts/across-space-frontier-3/</link>
      <pubDate>Thu, 28 Dec 2023 12:11:24 -0700</pubDate>
      <guid>https://bruceediger.com/posts/across-space-frontier-3/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;https://space.nss.org/book-review-across-the-space-frontier/&#34;&gt;Across the Space Frontier&lt;/a&gt;,&#xA;Joseph Kaplan, Wernher von Braun, Heinz Haber, Willy Ley, Oscar Schatchter, Fred Whipple,&#xA;edited by Cornelius Ryan, Viking Press, 1952.&#xA;part of a prose exposition&#xA;and elaboration of von Braun&amp;rsquo;s &lt;em&gt;The Mars Project&lt;/em&gt;,&#xA;the technical appendix of &lt;a href=&#34;https://bruceediger.com/posts/project-mars/&#34;&gt;Project Mars&lt;/a&gt;,&lt;/p&gt;&#xA;&lt;p&gt;Von Braun describes a lunar excursion,&#xA;to be undertaken as a way to ease into interplanetary travel,&#xA;and map the landing site for a lunar expedition.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
