MATLAB Programming Contest Blog
April 18th, 2011
We’re in the final few days of the contest, and we know that you’re anxious to know what prizes remain to be claimed. We’ll give you a few options.
First of all, we’re bringing back the venerable 1000-Node Challenge. The 1000-Node Prize will go to the entry with the best score that
- has 1000 or fewer nodes, and
- is submitted before 16:00 UTC time tomorrow (19 April)
Remember, you don’t need to shorten your variable names or remove comments to win this challenge. That’s exactly why we made it a node-count prize and not a character-count prize. This is how you calculate your node count.
t = mtree(filename,'-file');
Sergey is the acknowledged master of the Short Form. Can you beat him?
Next, as suggested we’re going to try a No Bogus Words Challenge. If you want to enter, you need to signal it to us by putting the three letters NBW at the beginning of your entry’s name (e.g. “NBW My Super Duper Entry”). We’re not changing the contest scoring code, so we’ll be checking your code after the fact. When the deadline has passed, we’ll look at the leading NBW entry and check it. Beware: if it actually does use any bogus words, the author will be disqualified from winning the NBW prize on any other entries, and we’ll move on to the next potential winner. The NBW winner needs to be submitted before 21:00 UTC on 19 April.
(If we had it all to do over again, we’d probably have made the bogus word penalties higher. But you never know how things are going to go until you start the contest and see what entries come in.)
Finally, there’s the Six Million Dollar Man prize. If you can break 6,000,000 for your “result”, regardless of any other consideration, you win the prize (note that you don’t actually win $6,000,000). Naturally, you can’t exceed the time limit, but other that that, all that matters is the result. My friend Dave on the contest team says it can’t be done. I realize it’s a stretch goal. We’ll just throw it out there and see what happens.