<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Word games with phone numbers: 1-800-RESULTS (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx</link><description>My boss forwarded me this blog which is a programming puzzle challenge: given a phone number, try to create a mnemonic, like 800-776-4726 is 800-PROGRAM He knows that I&amp;#8217;ve been writing word games on computers for years: I decoded a spelling dictionary</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105163</link><pubDate>Thu, 01 Apr 2004 03:23:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105163</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>re: Word games with phone numbers: 1-800-RESULTS</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105166</link><pubDate>Thu, 01 Apr 2004 00:37:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105166</guid><dc:creator>the1</dc:creator><description>This is nice.  Could you also post some sample results?  Not everyone has Fox Pro.&lt;br&gt;&lt;br&gt;I'm busy today, but will try to digest your program later this week.  In the mean while, can you provide some high-level description on your algorithm?  I saw your inline comments, but there is no overview.  Thanks.</description></item><item><title>re: Word games with phone numbers: 1-800-RESULTS (by Calvin)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105238</link><pubDate>Thu, 01 Apr 2004 03:01:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105238</guid><dc:creator>bertcord</dc:creator><description>you have some mad skillzzz</description></item><item><title>re: Word games with phone numbers: 1-800-RESULTS (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105301</link><pubDate>Thu, 01 Apr 2004 05:08:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105301</guid><dc:creator>wOOdy</dc:creator><description>@ The1:&lt;br&gt;&amp;gt;&amp;gt; Not everyone has FoxPro&lt;br&gt;Come on... It's in your MSDN package. See DVD2488 or CD2014. Just install it (It's one of the most wellbehavest MS apps I know: Doesn't alter anything on your PC, doesn't depend on anything. You could even just copy the directories to your PC and start working)&lt;br&gt;&lt;br&gt;@CalvinRH:&lt;br&gt;Seems the download is not yet working. Using MSVCR80.dll? Is that already compiled in VFP9? Any chance you recompile that puppy with the currently released version? &amp;lt;g&amp;gt;</description></item><item><title>re: Word games with phone numbers: 1-800-RESULTS (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105305</link><pubDate>Thu, 01 Apr 2004 05:14:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105305</guid><dc:creator>wOOdy</dc:creator><description>Ah, now the download is working.&lt;br&gt;&lt;br&gt;&amp;gt;&amp;gt; that’s an average of 2.8 bytes per English word not including the dictionary logic itself! But that’s another subject.&amp;lt;&amp;lt;&lt;br&gt;Which I would be very interested in.. &amp;lt;g&amp;gt; Are you using an IDX file for lookup? (For the Non-FoxPro folks: IDX is an Indexfile, which internally uses a compressed storage) Together with an empty dummy DBF, built on the fly, a INDEXSEEK() could just return a &amp;quot;Yes/No&amp;quot; on a search...&lt;br&gt;</description></item><item><title>First entry to my programming challenge</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105888</link><pubDate>Thu, 01 Apr 2004 23:43:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105888</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>re: Word games with phone numbers: 1-800-RESULTS (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105929</link><pubDate>Thu, 01 Apr 2004 22:04:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105929</guid><dc:creator>the1</dc:creator><description>Calvin,&lt;br&gt;&lt;br&gt;A minor thing: in your comments you said EnumNum() enumerates all the possible permutations of NUMDIGS digits.  The term permutation means a *ordering* of a sequence (e.g. &amp;quot;1923&amp;quot; is a permutation of &amp;quot;1239&amp;quot;).  I think you actually mean &amp;quot;combinations&amp;quot;.</description></item><item><title>Entries to my programming challenge</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#105986</link><pubDate>Fri, 02 Apr 2004 02:28:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105986</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>re: Word games with phone numbers: 1-800-RESULTS (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#106664</link><pubDate>Fri, 02 Apr 2004 19:18:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:106664</guid><dc:creator>B.Y.</dc:creator><description>&amp;gt;&amp;gt;you might wonder how 225000 words can fit into 679k: that’s an average of 3 bytes per English word not including the dictionary logic itself! But that’s another subject.&lt;br&gt;&lt;br&gt;This is a good subject for a programming challenge: compress a dictionary.</description></item><item><title>re: Word games with phone numbers: 1-800-RESULTS (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#106743</link><pubDate>Fri, 02 Apr 2004 20:46:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:106743</guid><dc:creator>the1</dc:creator><description>Calvin,&lt;br&gt;&lt;br&gt;I posted my own solution at &lt;a target="_new" href="http://blogs.msdn.com/the1/archive/2004/04/02/106691.aspx"&gt;http://blogs.msdn.com/the1/archive/2004/04/02/106691.aspx&lt;/a&gt;</description></item><item><title>Phone Number Word Games part 2 (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#107987</link><pubDate>Tue, 06 Apr 2004 00:40:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:107987</guid><dc:creator>VS Data Team's WebLog</dc:creator><description /></item><item><title>Phone Number Word Games part 2 (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#108035</link><pubDate>Tue, 06 Apr 2004 02:22:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108035</guid><dc:creator>VS Data Team's WebLog</dc:creator><description /></item><item><title>Solutions to the Phraser programming challenge</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#108704</link><pubDate>Wed, 07 Apr 2004 02:50:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108704</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>Solutions to the Phraser programming challenge</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#108710</link><pubDate>Wed, 07 Apr 2004 02:50:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108710</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>re: Word games with phone numbers: 1-800-RESULTS (by CalvinH)</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#111774</link><pubDate>Mon, 12 Apr 2004 19:40:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:111774</guid><dc:creator>garrettvm</dc:creator><description>Actually, they are neither permutations nor combinations. Since these terms are being used &amp;quot;expressively&amp;quot; rather than &amp;quot;precisely&amp;quot; either is probably descriptively OK here. The counting examples most likely make clear what is going on. Counting problems vary a lot and include much more than the basic permutation or combination--many are really hard.</description></item><item><title>Independence Day for blogging</title><link>http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx#5174881</link><pubDate>Fri, 28 Sep 2007 02:11:14 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5174881</guid><dc:creator>Calvin Hsia's WebLog</dc:creator><description>&lt;p&gt;Since July 4 th is nearing, I thought it would be appropriate to start my independent blog. In this first&lt;/p&gt;
</description></item></channel></rss>