<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Puzzle on billpg industries™</title><link>https://owl.billpg.com/tags/puzzle/</link><description>Recent content in Puzzle on billpg industries™</description><generator>Hugo</generator><language>en-us</language><copyright>© William Godfrey.</copyright><lastBuildDate>Thu, 26 Sep 2019 19:19:18 +0000</lastBuildDate><atom:link href="https://owl.billpg.com/tags/puzzle/index.xml" rel="self" type="application/rss+xml"/><item><title>A flag for Milton Keynes</title><link>https://owl.billpg.com/mkflag/</link><pubDate>Thu, 26 Sep 2019 19:19:18 +0000</pubDate><guid>https://owl.billpg.com/mkflag/</guid><description>&lt;p&gt;I wrote this page before I found out that Milton Keynes City Council has held a flag design contest for children and already selected their new flag. This page is for the historic record.&lt;/p&gt;
&lt;div align="center"&gt;&lt;embed type="text/html" src="https://krikienoid.github.io/flagwaver/#?src=https%3A%2F%2Fbillpg.com%2FImages%2FMKFlagForWaver.php&amp;background=blue-sky" width="97%" height="600" /&gt;&lt;/div&gt;
&lt;p&gt;Congratulations &lt;a href="https://www.bbc.co.uk/news/uk-england-beds-bucks-herts-61506835" rel="noreferrer noopener" target="_blank"&gt;Milton Keynes on your new City status&lt;/a&gt;. All self respecting cities need a flag. London, Coventry, St Albans all have really good ones. You should have one too.&lt;/p&gt;
&lt;p&gt;Having worked in Milton Keynes for over a decade, I was surprised to learn that Milton Keynes don&amp;rsquo;t have a flag. I was attending an event organised by a local group and they were using the &amp;ldquo;swan&amp;rdquo; flag of Buckinghamshire. This prompted me to set to work on a design.&lt;/p&gt;</description></item><item><title>Clever and totally pointless - my first publication</title><link>https://owl.billpg.com/clever-and-totally-pointless-my-first-publication/</link><pubDate>Fri, 24 Jun 2011 20:28:00 +0000</pubDate><guid>https://owl.billpg.com/clever-and-totally-pointless-my-first-publication/</guid><description>&lt;div style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em; text-align: center;"&gt;
&lt;img src="https://owl.billpg.com/images/Reading_a_magazine_by_ZaCky-300x200.jpg" data-border="0" width="200" height="133" /&gt;
&lt;/div&gt;
&lt;p&gt;Way back in the early 90s, I subscribed to a magazine (think of it like a big website but printed on paper and sent through the post) called &lt;strong&gt;‘PC Plus’&lt;/strong&gt;. It included a section called “Wilf’s Programmers Workshop” where every month, Mr Wilf Hey would present a project (usually written in GW-Basic) and discuss the principles at work. It was here where I first managed to get something clever into print, except I didn’t do it quite right.&lt;/p&gt;</description></item><item><title>Vinegar - refined Vigenère - can you break my cipher?</title><link>https://owl.billpg.com/vinegar-refined-vigenere-can-you-break-my-cipher/</link><pubDate>Sat, 12 Feb 2011 16:32:00 +0000</pubDate><guid>https://owl.billpg.com/vinegar-refined-vigenere-can-you-break-my-cipher/</guid><description>&lt;div style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"&gt;
&lt;img src="https://owl.billpg.com/images/s200_4753829490_07cd82e76d_b.jpg" data-border="0" width="176" height="200" /&gt;
&lt;/div&gt;
&lt;p&gt;I&amp;rsquo;m idly interested in cryptography, the art of scrambling a message so that it can be transmitted securely, and only someone with the magic key can understand the message.&lt;/p&gt;
&lt;p&gt;When I was young, I designed a cryptographic algorithm. I thought I was so clever, but just because *I* couldn&amp;rsquo;t break it, that doesn&amp;rsquo;t make it secure.&lt;/p&gt;
&lt;p&gt;In this article, I present my naive cryptographic algorithm. It&amp;rsquo;s very flawed, so please don&amp;rsquo;t use it for anything important. Can you find the flaw?&lt;/p&gt;</description></item><item><title>Computers are fast!</title><link>https://owl.billpg.com/computers-are-fast/</link><pubDate>Sun, 29 Nov 2009 18:15:00 +0000</pubDate><guid>https://owl.billpg.com/computers-are-fast/</guid><description>&lt;div style="clear: both; text-align: center;"&gt;
&lt;img src="https://owl.billpg.com/images/killer-sudoku-mid-right.PNG" data-border="0" /&gt;
&lt;/div&gt;
&lt;p&gt;&lt;strong&gt;Killer Sudoku&lt;/strong&gt; is a popular variant on the perennial Sudoku game found in British newspapers. The same rules about the numbers 1 to 9 appearing only once in row, column and 3x3 box still apply, but unlike Sudoku, the puzzle doesn&amp;rsquo;t come with any numbers filled in. Instead, cells are groups with dotted lines and the total of all those cells are written in. Here&amp;rsquo;s part of a puzzle. The two cells grouped by a 10 could be 1+9, 2+8, 3+7 or 4+6. (It can&amp;rsquo;t be 5+5 because that would mean two 5s in same box.) Not a lot to work on, but also look at the three cells grouped by a 23 in the same 3x3 box; The only possible fit is 6+8+9. This means the only possible fit for the 10 group is 3+7, as all the possibilities would clash with the 6,8 or 9 required to make the 23. I could go on. If you want to complete the puzzle, its the &lt;a href="http://www.guardian.co.uk/theguardian"&gt;Guardian&lt;/a&gt;&amp;rsquo;s &lt;a href="http://www.guardian.co.uk/lifeandstyle/2009/nov/28/sudoku-166-killer"&gt;puzzle number 166&lt;/a&gt;. The point of this article isn&amp;rsquo;t to solve the puzzle, but something I observed along the way. Am I sure there&amp;rsquo;s no other way to split 23 into three parts, 1 to 9, without duplicates? I confess, mental arithmetic is not my forte. Part of the puzzle solving process for me is going through each dotted group and building a crib sheet on all the possible ways to make the total, so I can cross them off later. This isn&amp;rsquo;t a part of the puzzle I particularly enjoy, so I decided to automate it. (Is that cheating? I don&amp;rsquo;t think so in my circumstances, but that&amp;rsquo;s another topic of conversation.) So I sat down and designed an algorithm&amp;hellip;&lt;/p&gt;</description></item></channel></rss>