[golf] Tangled Tale Leaderboard

Brad Greenlee <[email protected]>
Newsgroups gmane.comp.lang.perl.fun
Message-ID <[email protected]>
[This is the last NotFun message you'll get from me on this, FWPers. 
Tomorrow I'll post the actual solutions, which will hopefully be fun to 
decipher]

I said I'd post this in the morning, but I'd only gotten one response by 
then, so I figured I'd wait. Here's the current leaderboard. Might as 
well keep the contest open until tomorrow morning (GMT)...say 9am. Send 
me your solutions then and I'll post them some time tomorrow.

BTW, there were some questions about how the solutions are scored. For 
that I defer to the Generic perl golf rules at:
   http://www.xs4all.nl/~thospel/golf/rules.html

Here are the current standings:

1. Georg Moritz     - 150
2. Terje Kristensen - 156
3. Brad Greenlee    - 158
4. Tobias Gödderz   - 162

I've copied the challenge below in case you don't know what I'm talking 
about.

Once again, I encourage people to check out the "official" perl golf 
site at http://terje2.perlgolf.org/~pgas/score.pl?func=front

-b

This is the puzzle to solve:
http://scottkim.com/newmedia/tangledtale.html

Input: none. Encode the data you need to solve the puzzle in your 
solution; and no, just printing out the answers without actually 
"solving" the puzzle programatically doesn't count. Actually, if I had 
the time/inclination, I suppose the right thing to do would be to come 
up with a few other valid puzzles that could be used as input. But I 
don't (volunteers?)

Output: all solutions to the puzzle, one per line (sorry, Tobias!), in 
the form:

1 8 5 11 ... 16

Where the numbers, read from left to right, represent the order in which 
to visit the squares in order to solve the puzzle.

I will say that there is more than one answer to the puzzle. Checking 
whether your answers are correct is as simple as following your sequence 
on the puzzle.
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.