Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: PerlMonks puzzles

by damian1301 (Curate)
on May 11, 2001 at 03:30 UTC ( #79607=note: print w/ replies, xml ) Need Help??


in reply to PerlMonks puzzles

I think that this Perl Puzzle idea would be a good thing...if there were ideas to back it up.

Right now I can't of any good ideas for this other than "how does this code do this" and "why does this code do this" kind of questions, which just aren't really fun.

So, now I ask you, do *you* have any ideas for this Perl puzzles section you propose?

NOTE:No harshness intended.

Tiptoeing up to a Perl hacker.
Dave AKA damian


Comment on Re: PerlMonks puzzles
Re: Re: PerlMonks puzzles
by z0d (Hermit) on May 11, 2001 at 04:16 UTC
    Well I haven't thought of any good puzzles. Maybe "n queens' problem" would be a reasonable start.

    <-- z0d -->

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2014-07-31 07:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (245 votes), past polls