Perl Monk, Perl Meditation | |
PerlMonks |
Re: Re: Mission: Obfuscation (1)by jynx (Priest) |
on Nov 19, 2002 at 12:07 UTC ( [id://214089]=note: print w/replies, xml ) | Need Help?? |
Yeah, the problem is that some algorithms will automatically make it harder to read. By standardizing the algorithm people can't do something completely out there and gain an advantage there. In golf the advantage is all about finding the shortest algorithm and then use arcane knowledge to save strokes. Since algorithms are generally known for golf contests most of the solution lies in using more arcane knowledge. *sigh* i suppose my issue is that an obfuscation must start with an interesting algorithm. Just finding primes isn't interesting (and in fact there is no one right way to do it) but having a prime generator (albeit incomplete) is a bit interesting. This gives people not so good at obfuscation a chance because all that needs be obfuscated is the window dressing. It's more a way to see who can provide the most interesting window dressing, which is (imho) the smaller and more difficult part of obfuscation. So essentially i posted this:
jynx PS Also, the result is harder to verify if any algorithm is used (not necessarily here, but in the general case)... update: PS2: i did try to make the algorithm more general so that (hopefully many) liberties could be taken, and there are some things in the algorithm that can also be taken by principle rather than letter (one need not start at 3 for example. one could start at 1 or 2 just as easily so long as the output is correct). Unfortunately --as always -- my attempt to put thoughts to words is poor at best...
In Section
Meditations
|
|