I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution language?
I think it would be far more interesting to measure number of instructions to complete the objective. Though I suspect the folks familiar with assembly would run circles, perhaps you could segment by solution language?
http://www.hugi.scene.org/compo/
That one seems abandoned for a few years now but you can find plenty of tiny graphical effects here, executables are 512 bytes and below:
http://www.pouet.net/prodlist.php?type%5B%5D=32b&type%5B%5D=...
My favorite Perl golf challenge is something I got from Boston Perl Mongers many years ago:
You have the numbers 1 to 9 (in order), and in between each number you can insert a plus, a multiply, or nothing. Your program should print all expressions that evaluate to 2002. For instance it should print the solution
1*23+45*6*7+89
(and one other)I have a command-line solution in 80 characters, including the `perl ` at the beginning. It works on 5.10 and 5.16. I think there was a better solution back in the 5.8 days, but my notes are unclear.
I agree what you describe would be fun, too, but it isn't code golf.