<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:googleplay="http://www.google.com/schemas/play-podcasts/1.0"><channel><title><![CDATA[Architecting: Brain Food]]></title><description><![CDATA[Brain Food]]></description><link>https://www.architecting.us/s/brain-food</link><image><url>https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png</url><title>Architecting: Brain Food</title><link>https://www.architecting.us/s/brain-food</link></image><generator>Substack</generator><lastBuildDate>Sat, 11 Apr 2026 07:00:11 GMT</lastBuildDate><atom:link href="https://www.architecting.us/feed" rel="self" type="application/rss+xml"/><copyright><![CDATA[Architecting]]></copyright><language><![CDATA[en]]></language><webMaster><![CDATA[architecting@substack.com]]></webMaster><itunes:owner><itunes:email><![CDATA[architecting@substack.com]]></itunes:email><itunes:name><![CDATA[Architecting]]></itunes:name></itunes:owner><itunes:author><![CDATA[Architecting]]></itunes:author><googleplay:owner><![CDATA[architecting@substack.com]]></googleplay:owner><googleplay:email><![CDATA[architecting@substack.com]]></googleplay:email><googleplay:author><![CDATA[Architecting]]></googleplay:author><itunes:block><![CDATA[Yes]]></itunes:block><item><title><![CDATA[The Three Gods Logic Puzzle]]></title><description><![CDATA[You meet three gods.]]></description><link>https://www.architecting.us/p/the-three-gods-logic-puzzle</link><guid isPermaLink="false">https://www.architecting.us/p/the-three-gods-logic-puzzle</guid><pubDate>Wed, 22 May 2024 03:42:34 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>You meet three gods. One always tells the truth, one always lies, and one answers randomly. You can ask three yes-or-no questions, each directed to any god. They answer "ja" or "da," but you don't know which means yes or no. How can you determine who is who?</p><p><em><strong>Answer</strong>:</em> This is a complex logical puzzle involving framing questions such that no matter who you &#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-three-gods-logic-puzzle">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Three Switches]]></title><description><![CDATA[You are in a basement with three light switches, each corresponding to one of three light bulbs in the attic.]]></description><link>https://www.architecting.us/p/the-three-switches</link><guid isPermaLink="false">https://www.architecting.us/p/the-three-switches</guid><pubDate>Wed, 15 May 2024 03:05:57 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>You are in a basement with three light switches, each corresponding to one of three light bulbs in the attic. You can't see the bulbs from the basement. How can you tell which switch corresponds to which bulb with only one trip to the attic?</p><p><em><strong>Answer</strong>:</em> Turn on one switch and wait a few minutes. Turn it off, turn on another, and go to the attic. The lit bulb&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-three-switches">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Famous Fox, Goose and Bag of Beans Puzzle]]></title><description><![CDATA[A farmer must transport a fox, a goose, and a bag of beans across a river.]]></description><link>https://www.architecting.us/p/the-famous-fox-goose-and-bag-of-beans</link><guid isPermaLink="false">https://www.architecting.us/p/the-famous-fox-goose-and-bag-of-beans</guid><pubDate>Wed, 08 May 2024 00:16:25 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>A farmer must transport a fox, a goose, and a bag of beans across a river. His boat is only big enough for him and one other item. If left unattended together, the fox will eat the goose, or the goose will eat the beans. How does he get all three across the river without losing any of them?</p><p><em><strong>Answer</strong>:</em> First, he takes the goose across, leaves it on the other&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-famous-fox-goose-and-bag-of-beans">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Famous River Crossing]]></title><description><![CDATA[A wolf, a sheep, and a cabbage need to be taken across the river by a farmer in a small boat.]]></description><link>https://www.architecting.us/p/the-famous-river-crossing</link><guid isPermaLink="false">https://www.architecting.us/p/the-famous-river-crossing</guid><pubDate>Tue, 30 Apr 2024 22:05:47 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>A wolf, a sheep, and a cabbage need to be taken across the river by a farmer in a small boat. The boat can only carry the farmer and one other item at a time. The wolf can't be left alone with the sheep, and the sheep can't be left alone with the cabbage. How does the farmer do it?</p><p><em><strong>Answer</strong>:</em> First, take the sheep across, leave it, and return alone. Then ta&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-famous-river-crossing">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Broken Chessboard]]></title><description><![CDATA[A standard 8x8 chessboard has two opposite corners removed.]]></description><link>https://www.architecting.us/p/the-broken-chessboard</link><guid isPermaLink="false">https://www.architecting.us/p/the-broken-chessboard</guid><pubDate>Wed, 24 Apr 2024 08:56:31 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>A standard 8x8 chessboard has two opposite corners removed. Is it possible to cover the remaining board with 31 dominoes, each covering two squares?</p><p><em><strong>Answer</strong>:</em> No. Removing two opposite corners, which are of the same color, leaves 30 of one color and 32 of the other. Each domino covers one of each color, so it's impossible to cover the board.</p>
      <p>
          <a href="https://www.architecting.us/p/the-broken-chessboard">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Infinite Hotel Paradox]]></title><description><![CDATA[A hotel has an infinite number of rooms and all are occupied.]]></description><link>https://www.architecting.us/p/the-infinite-hotel-paradox</link><guid isPermaLink="false">https://www.architecting.us/p/the-infinite-hotel-paradox</guid><pubDate>Wed, 17 Apr 2024 07:08:44 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>A hotel has an infinite number of rooms and all are occupied. A new guest arrives. How does the hotel manager accommodate the new guest without asking any guest to leave?</p><p><em><strong>Answer</strong>:</em> The manager moves the guest in room 1 to room 2, room 2 to room 3, and so on, ad infinitum. This frees up room 1 for the new guest.</p>
      <p>
          <a href="https://www.architecting.us/p/the-infinite-hotel-paradox">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Two Doors and Two Guards]]></title><description><![CDATA[You're standing in front of two doors.]]></description><link>https://www.architecting.us/p/the-two-doors-and-two-guards</link><guid isPermaLink="false">https://www.architecting.us/p/the-two-doors-and-two-guards</guid><pubDate>Wed, 10 Apr 2024 06:50:32 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>You're standing in front of two doors. One door leads to certain death and the other to freedom. You don't know which is which. There are two guards, one by each door. One always tells the truth, the other always lies. You can ask one guard one question to determine which door is safe. What do you ask?</p><p><em><strong>Answer</strong>:</em> Ask either guard, "If I asked the other guar&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-two-doors-and-two-guards">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Hundred Coins Puzzle]]></title><description><![CDATA[You have 100 coins lying flat on a table, each with a head side and a tail side.]]></description><link>https://www.architecting.us/p/the-hundred-coins-puzzle</link><guid isPermaLink="false">https://www.architecting.us/p/the-hundred-coins-puzzle</guid><pubDate>Wed, 03 Apr 2024 06:10:55 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>You have 100 coins lying flat on a table, each with a head side and a tail side. 10 of them are heads up, 90 are tails up. You cannot feel, see, or in any other way find out which side is up. Split the coins into two piles such that there are the same number of heads in each pile.</p><p><em><strong>Answer</strong>:</em> Split the coins into a pile of 90 and a pile of 10. Then flip all &#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-hundred-coins-puzzle">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[I am not alive, but I can grow; I don't have lungs, but I need air; I don't have a mouth, but water kills me. What am I?]]></title><description><![CDATA[Answer: Fire.]]></description><link>https://www.architecting.us/p/i-am-not-alive-but-i-can-grow-i-dont</link><guid isPermaLink="false">https://www.architecting.us/p/i-am-not-alive-but-i-can-grow-i-dont</guid><pubDate>Wed, 13 Mar 2024 18:31:20 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><em><strong>Answer</strong>:</em> Fire.</p>
      <p>
          <a href="https://www.architecting.us/p/i-am-not-alive-but-i-can-grow-i-dont">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Infinite Chocolate Bar]]></title><description><![CDATA[You have a chocolate bar that consists of a 5x2 array of squares.]]></description><link>https://www.architecting.us/p/the-infinite-chocolate-bar</link><guid isPermaLink="false">https://www.architecting.us/p/the-infinite-chocolate-bar</guid><pubDate>Wed, 06 Mar 2024 18:30:21 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>You have a chocolate bar that consists of a 5x2 array of squares. You can break the chocolate bar along any row or column. What is the least number of breaks needed to separate each of the squares?</p><p><em><strong>Answer:</strong></em> 9 breaks. Each break separates one square until the last square remains.</p>
      <p>
          <a href="https://www.architecting.us/p/the-infinite-chocolate-bar">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Seven Candles]]></title><description><![CDATA[You have a 7-minute hourglass and an 11-minute hourglass.]]></description><link>https://www.architecting.us/p/the-seven-candles</link><guid isPermaLink="false">https://www.architecting.us/p/the-seven-candles</guid><pubDate>Wed, 28 Feb 2024 18:30:27 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>You have a 7-minute hourglass and an 11-minute hourglass. How do you measure exactly 15 minutes?</p><p><em><strong>Answer</strong>:</em> Start both hourglasses. When the 7-minute hourglass runs out, turn it over (7 minutes elapsed). When the 11-minute hourglass runs out, turn the 7-minute one over again (11 minutes elapsed, with 4 minutes left in it). When the 7-minute hourglass runs o&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-seven-candles">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Three Gods Riddle]]></title><description><![CDATA[Three gods A, B, and C are called, in no particular order, True, False, and Random.]]></description><link>https://www.architecting.us/p/the-three-gods-riddle</link><guid isPermaLink="false">https://www.architecting.us/p/the-three-gods-riddle</guid><pubDate>Wed, 21 Feb 2024 18:30:21 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p>Three gods A, B, and C are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a random matter. Your task is to determine the identities of A, B, and C by asking three yes-no questions; each question must be put to exactly one god. The gods understa&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-three-gods-riddle">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Balanced Beam]]></title><description><![CDATA[The Balanced Beam: A beam balances perfectly on a fulcrum.]]></description><link>https://www.architecting.us/p/the-balanced-beam</link><guid isPermaLink="false">https://www.architecting.us/p/the-balanced-beam</guid><pubDate>Mon, 11 Dec 2023 12:53:22 GMT</pubDate><enclosure url="https://substack-post-media.s3.amazonaws.com/public/images/a6e827ed-0be8-4426-b303-eb29719ef2eb_1024x1024.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><strong>The Balanced Beam:</strong> A beam balances perfectly on a fulcrum. On one end is a basket with a 10-pound rock. On the other end, a 2-pound rock. How can you make the 2-pound rock side hit the ground without touching either rock, and the beam remains balanced afterward?</p><p><em><strong>Answer</strong>:</em> Move the fulcrum to the side of the 2-pound rock. The longer arm will make its lighte&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-balanced-beam">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Airplane Fuel Puzzle]]></title><description><![CDATA[The Airplane Fuel Puzzle: An airplane can carry enough fuel for exactly half of the globe.]]></description><link>https://www.architecting.us/p/the-airplane-fuel-puzzle</link><guid isPermaLink="false">https://www.architecting.us/p/the-airplane-fuel-puzzle</guid><pubDate>Mon, 11 Dec 2023 10:45:08 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><strong>The Airplane Fuel Puzzle:</strong> An airplane can carry enough fuel for exactly half of the globe. It has a unique refueling system that allows fuel transfers in mid-air. What is the minimum number of airplanes required to get one plane around the globe, assuming all airplanes depart from the same airport and need to return?</p><p><em><strong>Answer</strong>:</em> Three airplanes. They fly tog&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-airplane-fuel-puzzle">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Poisoned Wine]]></title><description><![CDATA[The Poisoned Wine: A king has 1000 bottles of wine and one is poisoned.]]></description><link>https://www.architecting.us/p/the-poisoned-wine</link><guid isPermaLink="false">https://www.architecting.us/p/the-poisoned-wine</guid><pubDate>Mon, 11 Dec 2023 06:29:24 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><strong>The Poisoned Wine:</strong> A king has 1000 bottles of wine and one is poisoned. He has 10 slaves to test the wine and a 10-day party. The poison takes effect in exactly 10 days. How can the king find the poisoned wine in time?</p><p><em><strong>Answer</strong>:</em> The king uses a binary system to label the bottles and test them on the slaves. Each slave drinks from certain bottles according &#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-poisoned-wine">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Monty Hall Problem]]></title><description><![CDATA[The Monty Hall Problem: You're on a game show and given the choice of three doors: Behind one is a car; behind the others, goats.]]></description><link>https://www.architecting.us/p/the-monty-hall-problem</link><guid isPermaLink="false">https://www.architecting.us/p/the-monty-hall-problem</guid><pubDate>Sun, 10 Dec 2023 10:27:24 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><strong>The Monty Hall Problem:</strong> You're on a game show and given the choice of three doors: Behind one is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, revealing a goat. He then asks if you want to switch to door No. 2. Is it to your advantage to switch?</p><p><em><strong>Answer</strong>:</em> Yes, sw&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-monty-hall-problem">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[What Comes Once In A Minute, Twice In A Moment, But Never In A Thousand Years?]]></title><description><![CDATA[Answer: The letter 'M'.]]></description><link>https://www.architecting.us/p/what-comes-once-in-a-minute-twice</link><guid isPermaLink="false">https://www.architecting.us/p/what-comes-once-in-a-minute-twice</guid><pubDate>Sun, 10 Dec 2023 09:27:10 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><em><strong>Answer</strong>:</em> The letter 'M'.</p>
      <p>
          <a href="https://www.architecting.us/p/what-comes-once-in-a-minute-twice">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Weighing of Balls]]></title><description><![CDATA[The Weighing of Balls: You have 8 balls identical in size and appearance but 1 is heavier than the others, all of which weigh the same.]]></description><link>https://www.architecting.us/p/the-weighing-of-balls</link><guid isPermaLink="false">https://www.architecting.us/p/the-weighing-of-balls</guid><pubDate>Fri, 08 Dec 2023 16:04:05 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><strong>The Weighing of Balls:</strong> You have 8 balls identical in size and appearance but 1 is heavier than the others, all of which weigh the same. You have a balance scale that can compare the weight of any two groups of balls. What's the minimum number of weighings needed to find the heavier ball?</p><p><em><strong>Answer</strong>:</em> Two weighings. First, weigh 3 balls against 3 others. If th&#8230;</p>
      <p>
          <a href="https://www.architecting.us/p/the-weighing-of-balls">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[What five-letter word becomes shorter when you add two letters to it?]]></title><description><![CDATA[Answer: SHORT (add 'ER' to make SHORTER).]]></description><link>https://www.architecting.us/p/what-five-letter-word-becomes-shorter</link><guid isPermaLink="false">https://www.architecting.us/p/what-five-letter-word-becomes-shorter</guid><pubDate>Fri, 08 Dec 2023 12:21:21 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><em><strong>Answer</strong>:</em> SHORT (add 'ER' to make SHORTER).</p>
      <p>
          <a href="https://www.architecting.us/p/what-five-letter-word-becomes-shorter">
              Read more
          </a>
      </p>
   ]]></content:encoded></item><item><title><![CDATA[The Coin Triangle]]></title><description><![CDATA[The Coin Triangle: Flip the triangle.]]></description><link>https://www.architecting.us/p/the-coin-triangle</link><guid isPermaLink="false">https://www.architecting.us/p/the-coin-triangle</guid><pubDate>Thu, 07 Dec 2023 11:24:05 GMT</pubDate><enclosure url="https://substackcdn.com/image/fetch/$s_!V3PE!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F5eb9b4e2-832f-416a-ac6d-2a439f4c56fe_400x400.png" length="0" type="image/jpeg"/><content:encoded><![CDATA[<p><strong>The Coin Triangle:</strong> Flip the triangle. You have a triangle made of 10 coins arranged in 4 rows. Move only three coins to flip the triangle upside down.</p><p><em>Answer:</em> Move the coins from the left side of the bottom row to form the new apex of the triangle, and adjust the two rightmost coins from the same row to complete the sides.</p>
      <p>
          <a href="https://www.architecting.us/p/the-coin-triangle">
              Read more
          </a>
      </p>
   ]]></content:encoded></item></channel></rss>