<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Blockbuster Contest Wrap Up</title>
	<atom:link href="http://blogs.mathworks.com/contest/2006/05/02/winners-page-contest-evolution-and-final-analysis/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/contest/2006/05/02/winners-page-contest-evolution-and-final-analysis/</link>
	<description>The MATLAB Programming Contest is a semi-annual competition where contestants submit MATLAB code to try to solve a challenge.  For more information, see http://www.mathworks.com/contest/overview.html</description>
	<lastBuildDate>Sat, 21 Jan 2012 14:45:27 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Markus</title>
		<link>http://blogs.mathworks.com/contest/2006/05/02/winners-page-contest-evolution-and-final-analysis/#comment-102</link>
		<dc:creator>Markus</dc:creator>
		<pubDate>Tue, 09 May 2006 08:26:29 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/contest/?p=41#comment-102</guid>
		<description>I have just read the nice contest analysis of Hannes and Cobus. But there is actually one mistake in it: It was not me who introduced the nthroot-computation. It was not included in my twilight winning entry.</description>
		<content:encoded><![CDATA[<p>I have just read the nice contest analysis of Hannes and Cobus. But there is actually one mistake in it: It was not me who introduced the nthroot-computation. It was not included in my twilight winning entry.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Stijn Helsen</title>
		<link>http://blogs.mathworks.com/contest/2006/05/02/winners-page-contest-evolution-and-final-analysis/#comment-79</link>
		<dc:creator>Stijn Helsen</dc:creator>
		<pubDate>Sat, 06 May 2006 09:31:52 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/contest/?p=41#comment-79</guid>
		<description>The explained CalculateMoves looks a bit similar to my early SHsolver-calculations.  I expect that was too slow, because I wanted to hold too much intermediate results for faster later use.  I also did it on an enlarged board, I only didn&#039;t think of the unnecessary bottom row.</description>
		<content:encoded><![CDATA[<p>The explained CalculateMoves looks a bit similar to my early SHsolver-calculations.  I expect that was too slow, because I wanted to hold too much intermediate results for faster later use.  I also did it on an enlarged board, I only didn&#8217;t think of the unnecessary bottom row.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alan Chalker</title>
		<link>http://blogs.mathworks.com/contest/2006/05/02/winners-page-contest-evolution-and-final-analysis/#comment-62</link>
		<dc:creator>Alan Chalker</dc:creator>
		<pubDate>Wed, 03 May 2006 02:26:13 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/contest/?p=41#comment-62</guid>
		<description>Thanks for the writeups.  I&#039;m still curious what the cause of the speedup for obfuscated code was.  You said you figured it out midway through the contest and would tell us about it later.</description>
		<content:encoded><![CDATA[<p>Thanks for the writeups.  I&#8217;m still curious what the cause of the speedup for obfuscated code was.  You said you figured it out midway through the contest and would tell us about it later.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

