In a momentary[0] insanity I came up with the concept of anti-golf. Just looking for the largest solution wouldn't be fun. You can always add dead code. Demanding that every op-code should be executed isn't much better, then you just have to add ramdom not used calculations in the code.
For a while I thougt about the following rule: The program should break if you remove any subset of the characters. This would solve both the above problems. But I guess you would still be able to make abitrary long code-snippet by some use of eval and some code/decode functionality. At least it would become arbitrary hard to prove or disprove that the program follows the rules. Can anyone come up with a bounded measurement that can't be abused? On the other hand we could just say that instead of getting as close to score 0.00 as possible people should try to hit score 83.32 (for some given tie-breaker of course). I want to play but I don't have the dicipline just to play after-hours and I've been too busy at work for the last few months. -- Peter Makholm | Yes, you can fight it, but in the end the ultimate [EMAIL PROTECTED] | goal of life is to have fun http://hacking.dk | -- Linus Torvalds
