<?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: Alex P. and the Anatomy of a Tweak</title>
	<atom:link href="http://blogs.mathworks.com/contest/2011/11/09/alex-p-and-the-anatomy-of-a-tweak/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/contest/2011/11/09/alex-p-and-the-anatomy-of-a-tweak/</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>Wed, 07 Nov 2012 21:01:38 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Alan Chalker</title>
		<link>http://blogs.mathworks.com/contest/2011/11/09/alex-p-and-the-anatomy-of-a-tweak/#comment-6725</link>
		<dc:creator>Alan Chalker</dc:creator>
		<pubDate>Wed, 09 Nov 2011 16:52:06 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/contest/2011/11/09/alex-p-and-the-anatomy-of-a-tweak/#comment-6725</guid>
		<description>Real-world obligations have prevented me from participating much this time, but I&#039;ve been generally following along and am impressed with the level of collaboration in this contest.  

For the sake of posterity, I have been able to figure out the scoring formula and am posting it here as I traditionally do. As usual, it’s very similar to the recent contests:

score = k1*result + k2*e(k3*runtime) + k4*max(complexity-10,0) + k5*nodes

Where:

k1 = 0.01
k2 = 0.002
k3 = 4/30 (0.1333333)
k4 = 10
k5 = 0.01

Good luck to everyone in these final minutes of the contest!</description>
		<content:encoded><![CDATA[<p>Real-world obligations have prevented me from participating much this time, but I&#8217;ve been generally following along and am impressed with the level of collaboration in this contest.  </p>
<p>For the sake of posterity, I have been able to figure out the scoring formula and am posting it here as I traditionally do. As usual, it’s very similar to the recent contests:</p>
<p>score = k1*result + k2*e(k3*runtime) + k4*max(complexity-10,0) + k5*nodes</p>
<p>Where:</p>
<p>k1 = 0.01<br />
k2 = 0.002<br />
k3 = 4/30 (0.1333333)<br />
k4 = 10<br />
k5 = 0.01</p>
<p>Good luck to everyone in these final minutes of the contest!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
