Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: updated version of old sig

by jonadab (Parson)
on Oct 22, 2003 at 15:33 UTC ( #301246=note: print w/replies, xml ) Need Help??

in reply to updated version of old sig

Here you go, four lines:

@m=((16,(15)x15)x10,(16)x16);{$m[$c]|=16;(@a=grep!($m[$c+@$_[$l=0]]&(1 +6|$s*@$_[2])),[-1,1,2] ,[1,2,1],[-16,4,8],[16,8,4])?${($i,$j,$k)=@{$a[rand@a]},push@p,$c;$m[$ +c]&=~$j;$m[$c+=$i]&=~ $k;map{$_==16?$p:$_&=15}@m,$c=$s=1if++$v==150}:($c=pop@p) ;select$q,$q +,$q,(print"\ec",(_)x30 ,map{$l++%16?($l-1==$c?o:$_&8?_:$").($_&2?"|":_):"$/|"}@m[0..160])/9if +$s;$c>158&$s?0:redo}


Very nice obfu, BTW. ++

$;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}} split//,".rekcah lreP rehtona tsuJ";$\=$ ;->();print$/

Replies are listed 'Best First'.
Re: Re: updated version of old sig
by teamster_jr (Curate) on Oct 22, 2003 at 15:46 UTC
    LOL! - see updated post!

      Well, I thought about compressing it and bundling the results with a decompressor and eval, but the only type of compression I'm very familiar with is Huffman, and even after I renamed some variables and things to cut down on the number of distinct characters, the character set is still too broad for the size of the program, and so by the time I have to use only six of every eight bits to ensure that all the characters are printable, I can't get compression good enough to make room for the decompressor and tree, much less come out seventy-some keystrokes shorter.

      $;=sub{$/};@;=map{my($a,$b)=($_,$;);$;=sub{$a.$b->()}} split//,".rekcah lreP rehtona tsuJ";$\=$ ;->();print$/

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://301246]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (3)
As of 2021-04-11 23:55 GMT
Find Nodes?
    Voting Booth?

    No recent polls found