Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

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

Replies are listed 'Best First'.
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?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://79607]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (4)
As of 2018-05-27 16:20 GMT
Find Nodes?
    Voting Booth?