The Nineteenth Byte

DJMcMayhem

11:01 PM

@mınxomaτ OK cool. So 6-8 weeks? :P

How many people do you think will be on a single test run?

mınxomaτ

3 probably.

Scheduling is a bit complex.

People, not weeks that is.

On the topic of KC: The Hutter Prize wasn't awarded since 2009.

βετѧ Λєҫαγ

11:19 PM

1

Q: Enterprise Quality Code Prime SIeve

Enterprise Quality Code! Summary of this challenge Print (to make it more fair when competing with another language changing the output method could be a trivial way to golf) the first N Prime numbers. Your score will be the sum of the byte counts of all entries which no one has been able to go...

What the hell is up with the tags?

Conor O'Brien

I have no idea :P

mınxomaτ

tag-trolling

Conor O'Brien

CMC: given strings S and T, output STSTS. E.g., A, B -> ABABA and 10, 2 => 10210210

βετѧ Λєҫαγ

Man, I think the real prize goes to the person who fully understands how that hallenge works

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@βετѧΛєҫαγ wtf

Downgoat

11:23 PM

@βετѧΛєҫαγ @RohanJhunjhunwala

βετѧ Λєҫαγ

Be careful, he might start adding random tags

mınxomaτ

Also, that's cool: 1wt.eu/projects/libslz

βετѧ Λєҫαγ

Ooh Dennis mod hammered it

Anonymous

@ConorO'Brien 7 bytes in Actually: │a;)kεj

Anonymous

Oh wait you specifically said strings

Conor O'Brien

11:28 PM

what does that work on?

Anonymous

6 now: │a;)kΣ

Anonymous

The 7-byte one works on any input. But, since you specifically said strings, I'm using strings for input.

Conor O'Brien

oh, cool

Rohan Jhunjhunwala

@βετѧΛєҫαγ @ConorO'Brien I posted it on the sandbox and it seemed quite clear to those reviewing it. Although the tags may seem contradictory at first glance, perhaps the comment I left to Dennis may clarify it

Conor O'Brien

@RohanJhunjhunwala I never saw it in the sandbox. How long was it in there?

Anonymous

11:35 PM

Survey says: 24 hours

Rohan Jhunjhunwala

@Mego you beat me to it

Is 24 hours not long enough?

Conor O'Brien

not by a long shot.

Anonymous

Almost certainly not

Anonymous

1. So basically the accepted answer goes to the shortest answer in Unary? 2. The tags code-golf and code-bowling are mutually exclusive. This isn't really either. — Peter Taylor yesterday

Anonymous

For a simple challenge (like output the nth element of a sequence), 24 hours might be fine. For more complicated challenges, not even close.

El'endia Starman

11:37 PM

@RohanJhunjhunwala The recommendation is usually 72 hours.

Rohan Jhunjhunwala

And if you would read the post, and further comments, I talk about how the submissions are limited to fitting in one post. Thus the highest length is 30k a unary submission would most certainly not fit in 30k

Anonymous

There's no limit in the actual challenge to the length of the solution

Rohan Jhunjhunwala

@Downgoat that is golunar, and that is not the source code

@Mego it says that the source must fit in a single post

Downgoat

@RohanJhunjhunwala A) no B) ik, I didn't read but why make a pointless enforcement that the source must fit in the post?

that's a bad idea for multiple reasons

Rohan Jhunjhunwala

10

Q: The Bowlers-Golfers Fraction War

Introduction Let's start by arranging all fractions from 0 to 1 in order of lowest denominator, then lowest numerator: 1/2, 1/3, 2/3, 1/4, 3/4, 1/5, 2/5, 3/5, 4/5, 1/6, 5/6, 1/7... Note that duplicates aren't counted, so I haven't listed 2/4, 2/6, 3/6, or 4/6, since they already appeared in th...

code-challenge math code-bowling rational-numbers cops-and-robbers

Anonymous

11:40 PM

@RohanJhunjhunwala I have read through the challenge text multiple times, and I do not see where you state that restriction.

Downgoat

If I'm paying per byte. I sure as well don't want to be loading 30 kilobytes of unary

@RohanJhunjhunwala that is a flaw of the challenge rather than the answer

doing that would set a cap to answer length to 30K

DJMcMayhem

@ConorO'Brien way too long, but 11 Bytes: v.tryitonline.net/…

Rohan Jhunjhunwala

How to participate

Pick any language X, but please avoid selecting a language which is just another version or derivative of another answer. If there is no existing answer in language X than you will write a program (which must fit into a single post) that solves this challenge. The length in bytes of the source (in any reasonable preexisting textual encoding) will be added to your score. You must avoid using any unnecessary characters for reasons that will soon become apparent.

If language X already has been used to answer this question, then you must answer using any permutation of any …

note the (<b>which must fit into a single post</b>)

Downgoat

@DJMcMayhem can't you record ab and play it back or is that more byte?

wait yeah of course its more bytes

nvm

Anonymous

I see it now. Your description is so poorly-worded that it took me 3 scans after you pointed it out for me to actually see it.

trichoplax

11:42 PM

@RohanJhunjhunwala It's worth setting an explicit upper bound on code length, since the maximum length of a post may change in future

Anonymous

Or don't set an upper bound at all

quartata

@El'endiaStarman All right, here's the final result of all those questions I asked you:

gist.github.com/quartata/1300df4fd43c9cf0374e9548a2b6f209

trichoplax

@Mego I agree about minimum scores, but I can see the sense of having a maximum score in this case, otherwise the winner is just unary with no competition

Downgoat

@Mego speaking of that post. Is that mentioned in the FAQ? IMO it's a very good idea for new users to read over that

El'endia Starman

@quartata Oooh cool. What does it do?

quartata

11:46 PM

@El'endiaStarman Parses the transcript into a list of messages with likely replies (direct replies, pings within the next hour, and messages directly after) and then assembles a BK tree out of it

El'endia Starman

BK tree?

quartata

A kind of metric tree where the metric space is edit distance

So I can traverse the tree and find messages that closely matches a string

El'endia Starman

Ooooh, very interesting.

quartata

Then get their replies

trichoplax

@RohanJhunjhunwala For what it's worth, I think this is an interesting challenge type, and I'd like to see it refined so that it can be a good fit for the site. The trouble is that it is similar enough to several other challenge types that it will need a very clear description in order to avoid confusion. I'd recommend keeping it as short as possible without missing anything out, and using bullet points to emphasise the unique aspects.

Rohan Jhunjhunwala

11:47 PM

@Everyone ok, the maximum score has now been bolded what is unclear about the scoring mechanism?

quartata

I've only experimented with it with just one day, haven't parsed the whole transcript yet

Rohan Jhunjhunwala

@trichoplax ok, do you think you could work with me to fix it up

βετѧ Λєҫαγ

I dunno. I suppose I should read the challenge first... :P

El'endia Starman

@quartata How does it do?

trichoplax

@RohanJhunjhunwala That will depend on me understanding it correctly first - let me see if I do...

Rohan Jhunjhunwala

11:48 PM

ok

quartata

Your parser is pretty fast if that's what you're asking

Dennis

@RohanJhunjhunwala Nothing really, as soon as you edit the challenge. Comments don't count as part of the spec.

quartata

Finding the replies is gonna be O(n^2) so that'll be slow

Assembling the tree shouldn't be problematic

Rohan Jhunjhunwala

@Dennis ok, I will edit the spec

El'endia Starman

@quartata Can you not also create a dictionary where the keys are mids and the values are lists of rids?

I was mostly asking about the end result. Like, example input/output?

A day isn't much compared to the whole transcript, but you should still be able to do some interesting things with it.

quartata

11:51 PM

The actual thing just pickles the tree. I'll then be making a chatbot that takes a message and randomly picks a reply to a match

βετѧ Λєҫαγ

@RohanJhunjhunwala FYI there are a few spelling and grammatical mistakes such as Branfuck and wouldnt

trichoplax

1. Alice posts code of length N in language X.
2. Bob cannot post shorter code in language X until it is a permutation of a proper subset of Alice's code.
3. For language X, the winner is the shortest code posted.
4. The overall winner is the person with the highest score, being the sum of all the individual scores for languages in which they won.

quartata

So based on this day an example might be "Hello -> Ive posted something on the sandbox"

El'endia Starman

@quartata Technically, it's not my parser...

Rohan Jhunjhunwala

@βετѧΛєҫαγ ok fixing

trichoplax

11:52 PM

> The actual thing just pickles the tree.

βετѧ Λєҫαγ

Though Branfuck sounds like a brilliant language. It should be very good for your digestive system.

9

Dennis

@RohanJhunjhunwala One more thing though: Can we submit functions or are full prohrams required?

trichoplax

@RohanJhunjhunwala does my 4 point description reflect a correct understanding of your scoring mechanism?

Rohan Jhunjhunwala

essentially yes @trichoplax

Eᴀsᴛᴇʀʟʏ Iʀᴋ

@βετѧΛєҫαγ or it fucks with it

Dennis

11:54 PM

Feature-request: Chat should stop moving when I'm trying to select someting. :P

13

Rohan Jhunjhunwala

@Dennis I have edited the question, I apologize for the confusion I will be more patient in the sandbox.

βετѧ Λєҫαγ

:D

Damnit, Rohan split my smile from Dennis' comment :(

trichoplax

@RohanJhunjhunwala If you could open the challenge with a bullet point/numbered list style description of similar length, I think it would avoid people thinking the scoring mechanism is something else

Conor O'Brien

@Dennis this just happened while I was trying to click the star button.

Rohan Jhunjhunwala

@Dennis I require full programs only because it helps score

@Dennis also to prevent silly golfing by golfing off the boilerplate to make a full program

quartata

11:55 PM

def bk_query(message, tree):
  d = distance(message, tree[0].content)
  if d < THRESHOLD:
    yield tree[0]
  for node in tree[1][d - THRESHOLD: d + THRESHOLD]:
    if node:
      for match in bk_query(message, node):
        yield match

Downgoat

@Dennis omf 7 stars in two minutes O_O

quartata

@El'endiaStarman Traversing

Dennis

@RohanJhunjhunwala But you don't say so. Functions can still print.

βετѧ Λєҫαγ

@Downgoat I didn't think there were that many people here, watching

Hello ghosts!

El'endia Starman

@quartata .....I think I'm gonna need to read up on BK trees...

Rohan Jhunjhunwala

11:56 PM

@Dennis it does say "Write a program" in the challenge description, but it is buried somewhere in the wall of text. Should I open it up to functions and programs?

DJMcMayhem

@Downgoat it's actually the same number, but there's a bug. ;_;

v.tryitonline.net/…

quartata

@El'endiaStarman My bot is basically going to be a glorified spell checker

Dennis

@Downgoat I should star it myself to get it to 11 8.

Rohan Jhunjhunwala

I would explicitly put it in the bulleted explanation

El'endia Starman

Wow, what a stub!

BK-tree

A BK-tree is a metric tree suggested by Walter Austin Burkhard and Robert M. Keller[1] specifically adapted to discrete metric spaces. For simplicity, let us consider integer discrete metric d ( x , y ) {\displaystyle d(x,y)} . Then, BK-tree is defined in the following way. An arbitrary element a is selected as root node. The root node may have zero or more subtrees. The k-th subtree is recursively built of all elements b such that d ( a , b ) ...

Dennis

11:58 PM

@RohanJhunjhunwala Program means full program or function on PPCG. If you want to allow only full programs, say so explicitly.

quartata

@El'endiaStarman Found a blog post on it: blog.notdot.net/2007/4/Damn-Cool-Algorithms-Part-1-BK-Trees

El'endia Starman

The onebox has almost all of the actual content on that page.

Rohan Jhunjhunwala

@Dennis ok I will explicitly allow both in the bulleted list

trichoplax

@RohanJhunjhunwala By default, challenges are open to both programs and functions. It's up to you whether to restrict to just programs, but the consensus on meta is that you need to specify "full program" explicitly, otherwise it will be assumed that you also include functions, if you just say program.

ninjad again

βετѧ Λєҫαγ

Goodnight international people, Britisher here has to sleep

trichoplax

11:59 PM

@βετѧΛєҫαγ I guess that means I should sleep too...

βετѧ Λєҫαγ

@trichoplax Haha probably

Dennis

At 1 AM? o_O

quartata

@ConorO'Brien It was actually kind of funny you brought up that autocomplete thing since that day I had just started working on this