Well, if you've made it this far, I guess I've done better in the contest
than I thought I would.  Anyway...

The code basically creates a falling-hashmark-snowflake-like effect,
reminiscent of a demo I saw ages ago for some BBS in Sweden.  The program
makes a few simple code aliases to cut down on the byte count...

There's a big chunk of characters in there, which are a custom-encoded bitmap
of the final TPJ image.  A sequence of 2 regexps expands that bitmap back out
to a full 1/0 string.  The program then steps through that string bit by bit,
(or byte by byte, as it were), and executes a loop which draws the falling
hash mark sequence.  Next, it scrolls the whole thing up a few lines, and 
freezes it there.  Then, it scrolls it all back up to the top.

Another step through the bitmap allows the hash marks to fall to the bottom,
getting accumulated in an array to verify that the number of fallen hash marks
is the same as the number of them in the corresponding column of the bitmap.

Relatively straightforward code, just messy and ugly.  I wrote this a few
months ago, and never got around to applying some of the new Perl tricks I've 
learned since to make the code... uhhh... better.

=)

/Andrew
