« first day (1802 days earlier)      last day (3048 days later) » 

10:00 PM
@CᴏɴᴏʀO'Bʀɪᴇɴ because the same irony just happened to your question
 
@Pietu1998 Is that like the band U2 on ice?
 
q_p
I'm an idiot
:P
 
roflgolfer
 
@AlexA. I was looking at it, and nothing changed. Then I refreshed the page :P
 
haha
 
10:01 PM
So, just to clarify, if answers from the old challenge cannot be used on the new one, it isn't a dupe?
@CᴏɴᴏʀO'Bʀɪᴇɴ Double irony, actually.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ That's not what it says
It doesn't work both ways like that
 
@CᴏɴᴏʀO'Bʀɪᴇɴ well, if they aren't competitive with minor changes
 
@AlexA. No. The players are under 20 years of age. Also Finland just won the world championship. TORILLE
 
If an old answer can be used on the new challenge, it's a dupe.
If none of the old answers can be used on the new challenge, then it is not necessarily a dupe.
 
translate: torille
(from Finnish) the market place
what
 
10:04 PM
It could still be a dupe if, for example, nobody answered the old challenge but they are still the exact same challenge
 
@Rainbolt "if an old answer can be used on the new challenge and remain competitive..."
 
Right I forgot that extra qualification
I thought non competitive answers weren't answers, so technically my original statement is just as correct
 
Does that mean every answer in Java isn't an answer?
 
@AlexA. yesssss
 
10:09 PM
@AlexA. actually it's "to the market place", from the time Finland won and ~25k people rushed to the marketplace to celebrate
 
1
A: Sandbox for Proposed Challenges

TanMathStart a word with the end of a word When I was younger, I use to play a word game. It was very simple. It is called Word chain. The first player chooses a word, the next player says another word that starts with the same letter the previous word ended with. This goes on forever until somebody gi...

 
Yes, many think Finnish people are weird
 
@Pietu1998 That sounds cool=)
 
^
 
^ A minion doing the ^^ face?
 
10:22 PM
@CᴏɴᴏʀO'Bʀɪᴇɴ "not well received?" What? It has a +2 score...
 
@Doorknob +9/-7
 
iirc
DANG
idnrc
 
that's +25 rep.
 
One more upvote and this question is going to the main site...
 
10:23 PM
oh lol
I thought you were talking about my question :P
 
No.. Which question is yours?
 
@TanMath any reason there's . instead of a , after meatball?
 
This travesty:
2
Q: How's your string theory?

Cᴏɴᴏʀ O'BʀɪᴇɴBack to the basics! You're in you comp sci class again, except wiser and golfier. You have the tools, you have the power… but do you have the skill? Probably. Crash Course for the non-Computer Scientist (skip if you don't need it) A string is symbolically represented by an arbitrary letter (usu...

 
@MartinBüttner oops...
 
@TanMath if there are multiple solutions, should we return any?
 
10:25 PM
^ and no solutions?
 
well I guess a sequence consisting only of the starting word is also a solution
are the words in the list guaranteed to be unique?
 
@TanMath Please provide some longer testcases.
E.g. a dictionary of 100-1000 words
 
Ok..
 
> list cannot contain duplicate words
 
Otherwise it is too simple to just bruteforce=)
 
10:26 PM
@flawr I don't think that's necessary as there is no requirement for efficiency.
 
Hello people.
 
more test cases would still be good, which can't be solved greedily
 
But it will not be very challenging.
 
@flawr Right, but that's not a problem of the test cases, but a problem of the challenge :P
 
@BrainSteel Hello SteelBrain.
 
10:27 PM
@BrainSteel Hi
4
 
@flawr so I need to provide a list of 100 words?
 
0
A: Sandbox for Proposed Challenges

NinjaBearMonkeyExpand the numbers You may remember in first or second grade using expanded form to learn about place value of numbers. It's easier to explain with an example, so consider the number 123. In expanded form it is represented as 100 + 20 + 3, which helps a young mind visualize place value. It is re...

 
@TanMath you don't. unless you want to enforce efficient solutions.
 
@MartinBüttner it does not need to be fast
 
@TanMath You do not, but I think it would be fun to see how they perform.
 
10:30 PM
I have a maths puzzle: Suppose we have three circles in the plane, no two of which are coincident. Can you prove or disprove that it is always possible to find the total area of the plane within any of the three circles knowing only the areas of each circle and the area enclosed by their pairwise intersections?
 
I really do not have the time to make that... If somebody else wants to, you can
@MartinBüttner read the instructions
 
0
Q: Draw my bar graph

J AtkinYou have been chosen to make a program that creates some pretty ASCII bar charts. Here is the input format: [List of words (they can have spaces)] [an integer >= 0] Bar 3 This is so cool 4 IDK-Why 6 The input will have multiple lines in this format, each one representing one bar in the graph. ...

 
@BrainSteel Yes, I think so.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ it would print nothing
 
@TanMath coolio
 
10:31 PM
@TanMath which part?
 
O_O For some reason, the entire PPCG page was in Arabic
 
@flawr Proof or disproof? :D
 
@TanMath how can there be no solutions?
you can always have only the starting word
 
@TanMath sample(read.table("/usr/share/dict/words", as.is = TRUE), size = 100, replace = FALSE)
That is, if you're running R on a Unix-based system
 
@MartinBüttner you are right...
 
10:32 PM
you do need more test cases though
 
> The program should print out a sequence of words from the list such that the word starts with the same letter as the last letter of the previous word. The first word of the sequence is the input word. The sequence should be the longest possible sequence such that it cannot be extended further.
 
currently both of your test cases are essentially linear graphs, so they can be solved greedily
 
Is it UNIX or Unix? I've seen both.
 
@MartinBüttner meaning?
 
@TanMath yeah, that doesn't answer what I do if there are multiple such solutions
 
10:34 PM
@MartinBüttner oh, meaning the same length?
 
@AlexA. I think it's both.
 
@TanMath in your test cases, at each step of the process, there is only one possible word to check, because the first letters of the words are unique.
@TanMath yes
 
@BrainSteel I assume you mean either, not both?
 
it's both, in a quantum superposition
 
o shit
 
10:35 PM
When in doubt, UnIx.
 
I wonder if the letters are entangled or not though
 
Try measuring one of them and find out.
 
Better outsource your research to PPCG
(I swear that's what Lembik does :P)
 
@AlexA. who is (s)he?
@MartinBüttner I still didn't get it
@MartinBüttner print both
 
@TanMath The creator of many (rather complicated) mathematics challenges here on PPCG.
 
@TanMath that should definitely be specified then
 
@CᴏɴᴏʀO'Bʀɪᴇɴ I thought it was a quiz on Unix and Windows commands, not some lame blogpost
 
Knowing the areas of the circles, you know their radii. If one of the circles does not touch the others, it is trivial.

If no circle is fully contained in another one , you can find the distances between each of the centerpoints from their intersecting area and you have all data you need.

If one circle is fully contained and the two others are intersecting, you can ignore the outer circle and the problem is trivial.

If two circles are contained in one circle, the problem is trivial too.
 
@TanMath I can solve your test cases with the following algorithm: 1) look at the current word's last letter, 2) is there another word in the list with that as the first letter? yes: make it the current word and go back to 1), no: we're done.
 
10:38 PM
@TanMath ಠ_ಠ
@MartinBüttner There is no "we" in a program. Programs are cold-hearted things that have no companions.
:P
 
@MartinBüttner doesn't that solve the challenge?
 
@CᴏɴᴏʀO'Bʀɪᴇɴ You forget multithreading.
 
@flawr I thought about that for a second, but it's still the same program :P
 
7
A: What programming languages have been created by PPCG users?

Martin BüttnerBrian & Chuck Brian & Chuck was created by me, Martin Büttner, in November 2015. It was originally created for the language-design challenge Create a programming language that only appears to be unusable. I had been considering the concept of a programming language with two interacting program...

 
So what=)
 
10:40 PM
@TanMath no.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ We don't talk like that.
 
@flawr Ohhh, I see. I can't believe I missed that.
 
@MartinBüttner Still one program--oh wait. You're good.
 
@TanMath [cat, cute, ewok] attic
 
10:42 PM
@BrainSteel Missed what?
 
@AlexA. I didn't call him lame
 
:P
 
@flawr I got to the areas of intersections from distances and radii, so I don't know why I missed that you could get to distances from areas and radii.
 
@MartinBüttner oh...
Thanks for that testcase
 
you still need more complicated ones. e.g. one where the graph of joinable words has loops.
 
10:45 PM
@MartinBüttner huh? I am not a computer scientist!
 
write the words in the list on a sheet of paper (all over the place). draw an arrow from each word to another if the first word's last character is the same as the second word's first character. that's the graph of joinable words.
in your test cases, you'll notice that the arrows only form a single path through the words.
in my test cases you'll notice that there's a branch.
but the graph could be even more complicated: the branched paths could join back together later (e.g. [cat, cute, ewok, kilo, to, otter] attic)
but the graph could also have loops
e.g. [cat, today, yoda, attic] ferret
 
@MartinBüttner where is the loop?
 
that one doesn't have a loop, but it's still a more general graph than my first test case
the last one has a loop: cat -> today -> yoda -> attic -> cat
 
so...I think it should print on forever... I don't care...It makes it simple for the code golfers
 
1
Q: Make the pattern from composition notebooks

KSFTThis challenge was xnor's idea, taken from Digital Trauma's challenge donation thread. Your challenge is to write a program that, as xnor put it, "procedurally generate[s] the splotchy black-and-white marbled pattern on the covers of composition notebooks": [ Your program can either display ...

 
10:51 PM
how can it print forever if words can only be used once?
 
Oh yeah...I am acting dumb...I am out of it today for some reason...
thankfully you are here...
 
print "forever"
 
Thank you @NewMainPosts.
@Rainbolt lol
 
I hate code that uses macros for no reason whatsoever except to "look cool"...
 
@MartinBüttner Made an example with two connected loops and some 'tails': attic,cancel,loitering,gnocchi,improv, vivic,child,despair,rat,tragic,chimney,rex,xylophone
The longest path is just from attic to chimney just the way I just counted it.
You can add others if you want. @tanmath
 
11:00 PM
1
Q: Implement Multiplicative Fuzzy Logic

NBZInspired by this excellent challenge (from which the bulk of this text is blatantly duct-taped) – and my highschool philosophy project... I define the following operators: Fuzzy Conjunction a ×F b is a × b Fuzzy Division a ÷F b is a ÷ b Fuzzy Negation –F b is 1 – b Fuzzy Disjunction a +F b i...

 
> just
how is that really broad noise popcon at +4/-1 without close votes.
 
Just?=)
 
@flawr I think your sentence could have done without two or three of the instances of the word "just" :P
but yeah, thanks
I suppose you should rather ping @TanMath though
 
@MartinBüttner Oh.
That comes from the many times backspaceing and reodering the words.
 
@MartinBüttner This is also pretty trivial as a shader.
 
11:04 PM
@MartinBüttner +3/-3
But still no close votes
 
@mınxomaτ sure, if you're allowed to use noise :P
 
@MartinBüttner Even if not, making noise using GLSL is pretty easy. iq has some nifty bit-tricks for this.
 
the original wording implied that using noise is not allowed at all.
 
Imo it didn't imply that. Just bad wording, but the intention was clear.
 
The original wording to me made it sound like you couldn't use plotting functions or randomness
 
11:09 PM
You could replicate it without randomness though.
 
The output is supposed to be different each time you run it though
 
Oh right, missed that.
 
huh, +3/-2 now, last I saw it was -1 total score
(╯°□°)╯︵ ┻━┻
 
Solution: Get a sane browser
2
 
^
 
11:13 PM
^^
At this point, even lynx is better.
 
ಠ_ಠ
 
Oh wait, aren't you a Mac user?
 
Yes
 
I guess it's a bit of an excuse.
Though it's like using IE because you run windows.
reloads shotgun
 
Safari is actually a decent browser. IE is not.
 
11:15 PM
well now edge
 
@TanMath Windows 10? Can't trust it.
 
@TanMath Edge is not IE
Edge is even worse.
 
really?
 
really?
NINJA'D
 
Yep. It renders nothing correct.
 
11:16 PM
I actually like Safari a lot except for its newer security "features."
 
@AlexA. [citation-needed]
 
@CᴏɴᴏʀO'Bʀɪᴇɴ booyah!
 
@TanMath GGNREIGOTUINMASIGHTS
 
@Doorknob You saw the carefully chosen benchmarks yourself! It's also extremely stable. I have not once had Safari crash on me.
 
@mınxomaτ Got a screenshot to prove it?
@AlexA. Every time Firefox crashes, it's my fault. It looks at me, and shakes its head and goes back to whatever it was doing.
 
11:17 PM
@AlexA. You've run out of good things to say about Safari, so you have to resort to "well, it doesn't crash?" :P
 
@Doorknob That's not what I mean ಠ_ಠ
 
Who the hell made this 'graduation' notice?
> "This is a regular event, happening every day."
 
Why does this alter my links all the time.
 
I still don't understand the point of everyone discussing the site's design. Our questions per day isn't even close to the minimum required for being considered to graduate.
 
11:20 PM
@AlexA. Because we're making our own
 
@AlexA. That's what I've been trying to say
 
Our design will be primarily up to the SE design team. Sure, we'll have some input, but it's still their decision.
 
s/some/very little/
 
s/very little/virtually none/
 
Time will tell
 
11:23 PM
Remember that time we got a bunch of people to post like 12 challenges in one day?
We should try to do that once a week.
 
Which day should be busy day?
 
Last time we posted on Sunday night. That seems good because on Monday everyone is at work and bored, so our traffic is higher.
 
I don't think that's a good idea
 
Okra
3
 
I have so many challenges in sandbox that I can move to take over the world to take over PPCG to help raise the Q/Day
 
11:25 PM
better to just have people commit to posting consistently (like I am \o/)
I'm on "one question every other day" schedule
 
I TRIED SO HARD AND GOT SO FAR BUT IN THE END I COULDN'T EVEN GET A PICTURE OF BHINDI MASALA FROM GOOGLE IMAGES
 
403 forbidden
 
@AlexA. Linkin Park?
 
Good night.
 
11:28 PM
@flawr Good night!
 
@AlexA. Do you still have a ban on posting pictures of food after World Big Dosa?
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Haha yes, it was intended to be a Linkin Park reference. :P
 
@trichoplax Never have I had such a ban. I'd petition SE
 
11:28 PM
:P
 
There we go. There's some bhindi masala.
 
Wow that looks good
 
I was trying to get it from Veg Recipes of India because they have great pictures and great recipes but this rando from Google Images will have to do.
 
hello @trichoplax
 
hello :)
 
11:31 PM
@CᴏɴᴏʀO'Bʀɪᴇɴ huh?
@trichoplax have you seen my latest sandbox post?
 
@TanMath Good game, No retries, I got you in my sights.
 
@TanMath Not yet...
 
@CᴏɴᴏʀO'Bʀɪᴇɴ me too! ಠ_ಠ
 
@TanMath ಠ_ಠ
staring contest
 
Makes a change from starring contests...
3
 
11:33 PM
contest whoever get's the least number of stars on their NEEEEEEEEEEEEEEXT post wins.
 
Looks like you're winning
Okay
 
s/amount/number/
2
ono I lost
 
Yoko OH NO
 
also, get's? Get's?!?!
 
11:36 PM
I did that one on purpose.
 
>:O
 
I have the least amount of stars on my post after the challenge post
 
Remember when we had that pinned message about not abusing stars?
 
unsheaths star-clearing-sword
 
@AlexA. you saw nothing
 
11:38 PM
@CᴏɴᴏʀO'Bʀɪᴇɴ nope!!
 
destroy the evidence
 
who did that!!
 
boo @Doorknob
 
Wasn't me ¯\_(ツ)_/¯
 
11:40 PM
really?
 
Yes really
 
Sorry for eating the stars
 
another lying mod
@trichoplax YOU DID IT???
 
I nuked a bunch of stars.
 
I actually only ate one...
Just because I've never tried one before
 
11:41 PM
Dec 16 '15 at 3:47, by BrainSteel
I can't believe there are 3 moderators here and the chat looks like this.
 
They're crunchy
 
Weird to talk of nuking them, considering what they are...
 
^
 
Weird to talk about eating them, considering what they are. :P
 
"I nuked the nuclear furnace"
@AlexA. Touché :)
 
11:42 PM
"I ate the nuclear furnace."
3
 
Only one...
 
It was spicy
 
@AlexA. "I ate the eating furnace"
 
I ate the nuclear furniture.
 
furniture the eat I
 
11:43 PM
^ yoda?
 
butter
 
what is this room for?:
 
It's for us
 
11:45 PM
What is it good for? Absolutely nothing.
 
i mean, the 19th byte is useful but this room?^
 
imo 🎆 looks like a mutant spider
 
lol
 
^
 
Or a spider with boxing gloves. That'd be cool.
 
11:47 PM
It'd need 3 pairs
 
> Today is our opportunity to create the first esolang of 2016
Seems to sum it up...
 
Does anybody other than Dennis find this disturbing?
 
I do
 
Does anyone not?
 
Aww, I was hoping people would say no.
 
11:48 PM
2 hours ago, by Alex A.
There is no need to thank the feeds bots. They are cold, unfeeling robots.
 
You are mean @AlexA..
 
¯\_(ツ)_/¯
 
Jan 2 at 19:46, by New Sandboxed Posts
HELP I'M TRAPPED IN A SAND FACTORY
 
@RikerW I do
 
Please do not feed the bots
3
 
11:49 PM
Dec 30 '15 at 17:04, by Alex A.
@NewMainPosts Dare to dream, buddy. Dare to dream.
 
At least they are self-aware.
 
Dec 30 '15 at 17:07, by Alex A.
I can't. You see, we have a special bond, @NewMainPosts and I...
@AlexA. TRAITOR!!!!!
 
Allow me to reiterate: ¯\_(ツ)_/¯
 
You are mean.
 
That's not nice.
 
11:50 PM
( ͡↑ ͜ʖ ͡↑)
 
@RikerW tr8r
 
Does anybody else think @AlexA. is a traitor?
If you are going to say no, don't say it.
 
Alex A. and RikerW are sock puppets of the bots. No one else talks to the bots.
 
@RikerW No
 
@isaacg Really?
@trichoplax I will ignore that comment.
 
11:52 PM
@RikerW Well obviously you already know. It was for the benefit of the others :P
 
@RikerW I don't even know what group they're supposed to be betraying, so why would I think they're a traitor?
 
@trichoplax Actually I'm @Doorknob's sock puppet. He just couldn't get enough moderation so he got his sock puppet appointed as a mod as well.
@isaacg s/they/he/
 
The RikerWbot infection seems to be spreading to other chat rooms.
 
can confirm; please merge @AlexA.'s account into mine along with all the answers/rep/etc.
 
11:53 PM
@AlexA. Got it, wasn't sure.
 
:P
 
he're?
 
Ye's
 
I'm not good at gendering birds.
3
 
in The Cornell Box, 2 mins ago, by RikerW
Thank you @NewMainPosts.
 
11:54 PM
@isaacg ( ͡° ͜ʖ ͡°)
 
in The Cornell Box, 2 mins ago, by RikerW
You are unrewarded, and deserve to be rewarded.
in The Cornell Box, 1 min ago, by RikerW
So thank you for all your hard work.
 
See, I thank them no matter what.
 
brb going to SO chat.
 
On a more serious note,
 
11:55 PM
Aww, there are too many.
Sorry, go ahead @isaacg.
 
I'd like to call for suggestions to improve Pyth
 
Pyth 4, not 5, right?
 
My question to this effect was very helpful, but deemed offtopic for the site
Yeah, current Pyth.
Chat messages, PMs, github issues
 
Put in interpreters for other golfing languages, so features can be mixed.
 
11:57 PM
@isaacg I suggest built-in "ಠ͜ʖಠ", which executes sudo rm -rf --no-preserve-root
 
lol
 
@RikerW I could do that, but it seems against the spirit.
Also, I'm not sure how they would interoperate at all
 
I see it as collaboration.
But yeah, compatibility might be an issue.
 
This seems like an opportunity for a new language, which does nothing but run other golfing languages
 
So... Bash?
 
11:58 PM
rofl
 
Well, golfed bash, maybe @AlexA.
 
Actually that would be a good idea.
 
If you're just passing data back and forth between esolangs, just Bash pipes everywhere
 

« first day (1802 days earlier)      last day (3048 days later) »