<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Puzzles on dlow's blog</title><link>https://blog.dlow.me/puzzles/</link><description>Recent content in Puzzles on dlow's blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 13 Apr 2019 18:58:12 +0100</lastBuildDate><atom:link href="https://blog.dlow.me/puzzles/index.xml" rel="self" type="application/rss+xml"/><item><title>Panza's paradox</title><link>https://blog.dlow.me/puzzles/panzas-paradox/</link><pubDate>Sat, 13 Apr 2019 18:58:12 +0100</pubDate><guid>https://blog.dlow.me/puzzles/panzas-paradox/</guid><description>&lt;h3 id="part-1">Part 1 &lt;a class="anchor" href="#part-1">&lt;span>&lt;/span>&lt;/a>&lt;/h3>&lt;p>I have three prizes, and I promise that I will give you either A or B if you give me a true statement and give you C if you make me a false statement.&lt;/p>
&lt;p>&lt;strong>Q: What statement should you make if you want to get prize A&lt;/strong>&lt;/p>
&lt;h3 id="part-2">Part 2 &lt;a class="anchor" href="#part-2">&lt;span>&lt;/span>&lt;/a>&lt;/h3>&lt;p>Now I bring in prize D and make you a promise that I will give you either A or B if you give me a true statement and give you C or D if you give me a false statement.&lt;/p></description></item><item><title>October curiosities</title><link>https://blog.dlow.me/puzzles/october-riddles/</link><pubDate>Thu, 12 Oct 2017 00:44:06 +0000</pubDate><guid>https://blog.dlow.me/puzzles/october-riddles/</guid><description>&lt;p>These are some of the puzzles/tricks I&amp;rsquo;ve been thinking about these weeks.&lt;/p>
&lt;h1 id="dividing-area-up">Dividing area up &lt;a class="anchor" href="#dividing-area-up">&lt;span>&lt;/span>&lt;/a>&lt;/h1>&lt;blockquote>
&lt;p>You have a 1x1 unit square area that you want to divide into 3 equal area. What&amp;rsquo;s the least length of lines needed to do so?&lt;/p>&lt;/blockquote>
&lt;p>&lt;a href="https://fivethirtyeight.com/features/can-you-beat-the-game-show/">Source&lt;/a>&lt;/p>
&lt;p>Before we try something, we should have a naive solution. We can simply draw two lines. So our answer should be &amp;lt;= 2.&lt;/p>
&lt;p>Next, what if we draw a horizontal line that cuts off 1/3 of the area, and then have another line perpendicular to it to divide the remaining area into two. The result there is 1 + 2/3.&lt;/p></description></item><item><title>An IOI practice round question</title><link>https://blog.dlow.me/puzzles/devils-chessboard/</link><pubDate>Thu, 31 Aug 2017 23:46:47 +0000</pubDate><guid>https://blog.dlow.me/puzzles/devils-chessboard/</guid><description>&lt;p>There are three people, A, B and C, a 8x8 board with cells labelled 1 to 64, and 64 coins. A and C first goes into a room out of B&amp;rsquo;s sight. A places a coin on each of the 64 cells on the board. C can flip any number of coins as she pleases and when she is done, she points to one cell on the board. A then flips &lt;strong>exactly&lt;/strong> one coin and C then takes the board out of the room and show it to B. B takes a look at the board, and points to a cell which C originally pointed out in A&amp;rsquo;s presence. The puzzle is to figure out how that is done.&lt;/p></description></item><item><title>Nelson Goodman's method</title><link>https://blog.dlow.me/puzzles/nelson-goodman/</link><pubDate>Wed, 28 Jun 2017 00:37:45 +0100</pubDate><guid>https://blog.dlow.me/puzzles/nelson-goodman/</guid><description>&lt;blockquote>
&lt;p>&amp;ldquo;I am not a liar.&amp;rdquo; - Everbody&lt;/p>&lt;/blockquote>
&lt;h4 id="part-1">Part 1 &lt;a class="anchor" href="#part-1">&lt;span>&lt;/span>&lt;/a>&lt;/h4>&lt;p>There are three brothers: John, James and William. One day you meet one of them on the street and you want to know which of the brothers he is. You are allowed to ask him one question answerable by yes or no.&lt;/p>
&lt;ol>
&lt;li>John and James always lie. William always tells the truth. You wish to find out whether is he John.&lt;/li>
&lt;li>Now John and James always tell the truth, and William always lie. You wish to find out whether he is John.&lt;/li>
&lt;/ol>
&lt;h4 id="part-2">Part 2 &lt;a class="anchor" href="#part-2">&lt;span>&lt;/span>&lt;/a>&lt;/h4>&lt;p>There are now only two brothers. One of them is called Arthur. One of them always lie and the other always tells the truth. One day you meet the two brothers together. You are allowed to ask one of them one question answerable by yes or no.&lt;/p></description></item><item><title>Solving puzzles via programming</title><link>https://blog.dlow.me/puzzles/computer-and-puzzles/</link><pubDate>Sat, 03 Jun 2017 13:14:45 +0100</pubDate><guid>https://blog.dlow.me/puzzles/computer-and-puzzles/</guid><description>&lt;p>Recreational puzzles require only elementary knowledge. It should be easy to understand and it shouldn&amp;rsquo;t be trivial to solve. Sometimes these problems can be solved analytically. This short entry is about how might computers help us.&lt;/p>
&lt;h3 id="puzzle-1">Puzzle 1 &lt;a class="anchor" href="#puzzle-1">&lt;span>&lt;/span>&lt;/a>&lt;/h3>&lt;p>The string a1 ^ a2 ^ a3 is ambiguous because it could mean (a1 ^ a2) ^ a3 or a1 ^ (a2 ^ a3). There are two different formulas from that string. How many different formulas can the string a1 ^ a2 ^ &amp;hellip; ^ an produce?&lt;/p></description></item></channel></rss>