Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Re: Re: Re: Re: Beyond Golf - reading between the tokens

by theorbtwo (Prior)
on Dec 29, 2002 at 06:39 UTC ( #222866=note: print w/replies, xml ) Need Help??

in reply to Re: Re: Re: Re: Beyond Golf - reading between the tokens
in thread Beyond Golf - reading between the tokens

Yah. You've got a point. The best way to judge such a thing may be to have an "impartial" judge decide which one they like best.

Personaly, I like the idea of the various scored programing contests. Your bottles-of-beer question is simply a bad question. A better one would have read: write a function, bottles_of_beer, which takes a single parameter, the number of bottles to start with. It should return a string of the form "$n bottles of beer on the wall, $n bottles of beer. You take one down, you pass it around...\n$n-1 bottles of beer on the wall"..., where $n is the number passed in. It should end with the line "ENOBEER", after you've passed around the last beer.

"Winners" will be programs that do it in the fewest number of characters (as mesured by ls -l, on a one-character-newline system), the fewest opcodes (as mesured by B::Concise), and the shortest running time (on my system).

(In fact, can anybody find issue with this form of rules? I might write up a Tutorial on golf contests... even though I don't purticularly like writing it. (I might like doing perl racing, or minimal-opcode-programing (NEED BETTER NAME!), though.) Hm. Two more scoring methods just crossed my mind: B::Size (more then number of opcodes, since it also includes info on constants), and the size of the output of B::Assemble (more then B::Size, less then B::Size? Different in any way the B::Size? I don't know)

Anyway, I find the topic very intersting, and am probably going to ponder mroe on it. But now, I'm going to bed.

Warning: Unless otherwise stated, code is untested. Do not use without understanding. Code is posted in the hopes it is useful, but without warranty. All copyrights are relinquished into the public domain unless otherwise stated. I am not an angel. I am capable of error, and err on a fairly regular basis. If I made a mistake, please let me know (such as by replying to this node).

  • Comment on Re: Re: Re: Re: Re: Beyond Golf - reading between the tokens

Replies are listed 'Best First'.
Re^6: Beyond Golf - reading between the tokens
by Aristotle (Chancellor) on Dec 29, 2002 at 17:20 UTC
    I too was at a loss for good names for the minimal-opcode version of golf.. Anyway, I'd be interested in getting this tutorial to see the light of day, considering I got this particular ball rolling. :) If you don't feel like writing it all yourself, I'd be glad to lend a hand or two.

    Makeshifts last the longest.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://222866]
[ozboomer]: Howdy, all.. Trying this once more... Not really a perl question :(... but I don't know how to even title my query (more...)
[ozboomer]: There's a text file with lots of sections in it, like an '.ini/.conf' file. Each section can be 'used' or 'unused' by its application (more...)
[ozboomer]: Some folk want to use the text file as 'storage', keeping ALL items in it (a database); others call it an 'active document' that should only contain 'in-use' sections. Is there a 'good practice' for this sort of thing?

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (3)
As of 2018-05-21 00:23 GMT
Find Nodes?
    Voting Booth?