« first day (2104 days earlier)      last day (2746 days later) » 

3:01 PM
I don't think there's a "verdict" per se, but I don't see any reason to not allow it, assuming you are a good sport about it
For example, adding built-ins shouldn't be done
 
TIL Vi is 40 years old.
 
changing a language based on the sandbox is a bad idea. Writing an answer is good/bad based on who you ask. Some people don't like it because of the FGITW effect
 
On the other hand, it's actually a good thing because it makes you aware of potential issues in the challenge, so it can be great for giving solid feedback
^^ Agreed, I would consider FGITW-ing it not being a good sport
 
"So in this G=1 unit system you're thinking of, mass is measured in cubic meters per second per second. Weird, huh? Well, that's why we use kilograms in the real world." physics.stackexchange.com/questions/36375/…
 
@Poke I just finished golfing a Java answer to Mego's sandboxed challenge, so I might be biased :P
Got it under 100 :D
 
3:04 PM
I think he just meant working on an answer before the challenge is posted to main, which I'm pretty sure is fine
 
Yeah, I personally don't see an issue with working on a challenge in the Sandbox
 
@betseg I know, it's ancient. The interesting thing is how many knock-offs and clones there are. off the top of my head, there's ex, vi, vim, neovim, stevie, and a bunch of others
Elvis, nvi, vile...
 
When did TimmyD become a unit?
 
About an hour ago.
 
nah, its a fundamental unit. We just discovered it an hour ago
 
3:09 PM
Speaking of old things, in my OS class we were doing presentations on old operating systems, like features and whatnot. I managed to find a download for ours and while snooping around I found a folder for python 1.2 or something and was like huh, that's interesting. Turns out Python was originally developed on/for the OS we randomly chose: en.wikipedia.org/wiki/Amoeba_(operating_system)
 
@Geobits crap i was doing the same thing
 
is yours under 100
 
the function is 80 bytes
currently
 
well now we have a competition
 
I'm at 95 right now, but I'm thinking I can get it significantly shorter if I can figure this one lil thing out.
 
3:13 PM
A Java answer under 100 bytes? I'm impressed ;)
 
Which challenge?
 
3
A: Sandbox for Proposed Challenges

MegoBinary Countdown Length inspired by Count down from infinity Given a positive integer N, output the number of repetitions of the following steps it takes to reach 0: Convert N to binary (4812390 -> 10010010110111001100110) Flip each bit (10010010110111001100110 -> 01101101001000110011001) Tri...

 
I had a bug... Fixed it at the cost of a byte
 
Thought I had a way to do it with a simple split, but it's not working right :(
 
Are you supporting long
 
3:25 PM
Yeah
mainly for the shorter conversion to binary string
 
I was as well
yup
My original solution was to count the number of times the string switched from 0 to 1 or vice versa but there's too much java for that solution to be short
 
Ohhhh I got it
Lemme see how short I can get this.
 
@Poke Usually for some challenges in the sandbox if they are not too complicated I write a program, usually not very golfed that I can use to find flaws in the challenge. But I don't reuse that when the challenge gets posted.
 
Yeah, I was doing the same, but couldn't get it right.
 
:o ascii-art downvote button
 
3:29 PM
@Fatalize We may be past that at this point >.> oops
 
@Poke Finally got it down to 65 :D
 
also realized i was counting the static keyword which isn't necessary if the submission is just a function
 
Yeah, no static
Had to get rid of long support to get it that low though.
Hmm. Actually, it's exactly the same with long and int :/
Wait no, 64 with long.
 
You guys' byte counts seemed high... I get 44
 
in Java?
 
3:34 PM
yes
 
Huh. What are you doing to the thing?
 
And real funciton, not lambda.
 
Yeah, no lambda here
I could get it about that low by taking input as a binary string, but other than that I'm not sure how.
 
I also take long.
 
Hmm... are you even converting it to a string? That part alone gets me to 38 bytes...
Oooooh wait let me play with this...
 
3:39 PM
43 now.
 
Bah. My mathy idea came out at 69 instead :/
 
@Geobits This avatar is so confusing
 
Isn't there a site where the button actually looks like that?
 
Is returning a generator in Python valid? It would mean you would have to do print(*f()) instead of print(f()) when calling it.
 
@feersum I thought my 54-byte Python solution was decent :/ I can't let myself be beaten by Java!
 
3:53 PM
It's 30 in Python
 
._.
I assume at no point you are doing any math?
I should rephrase
 
What is math?
 
I assume you are not doing any XORing?
 
I have been invited to join Trash, but I'm already a member of the Trash chatroom ;)
 
3:58 PM
Let me say it more directly, then: stop posting stupid stuff. At least, post it somewhere other than TNB.
 
Oh i think I see what you're doing, @Geobits
forgot split could take a regex
 
Oh, yeah, my 64 is a regex.
 
If there's a 30 byte Python solution I may as well give the 54-byte version
f=lambda n,c=0:f(n^2**n.bit_length()-1,c+1)if n else c
Of course there's a regex solution!
 
I've got:
long g(Long n){return n.toString(n,2).split("0+").length*2-n%2;}
I can't seem to get a shorter mathy way, and I can't see chopping 20 bytes from the string version.
 
yeah I was on my way to that after i realized
you should be able to return int still
 
4:01 PM
Then you have to cast the return :/
 
why
 
Because it won't auto-cast long to int.
 
you don't have a long at that point
.length returns an int
no?
 
My compiler says otherwise
 
here's my 71 int b(Long a){return a==0?0:1+b(~a&-1L>>>64-a.toString(a,2).length());}
 
4:03 PM
Oh, it's because of n%2, since n is long.
 
before realizing split took a regex
well
time for lunch
 
this may be the first time people are actually discussing golfing in Java in this chat room
5
congrats all :)
 
That is why I created JGolf, a golfed version of Java
 
The idea for a golfed Java has been around for a while. Nobody's actually done it and used it though AFAIK.
 
It's still developing
I've just added golfed for-loops
 
I think I vaguely remember hearing about stuff like this, but it's really cool to see it shown this way. Bouncing oil droplets exhibit many properties seen in quantum mechanics - youtube.com/watch?v=WIyTZDHuarQ
 
@TuxCopter I'm still going to develop JGolf
 
@TuxCopter Yeah... Glava seems mostly like a rename/replace "language" though, which is unfortunate. It's also only been used on three answers.
 
:/
 
So you get either a stuff with name abbreviations (lame), or something with little relation to Java.
 
4:12 PM
@feersum Which one is JGolf?
 
OSX cursor vs. JWM default cursor
 
I don't know, psychic powers don't seem to be working.
 
@NathanMerrill Counterexample! :P
 
@feersum Maybe you need a TwistedSpoon.
 
@El'endiaStarman of course, the person who owns the chat data explorer finds it :P
 
4:17 PM
@NathanMerrill >:D
I couldn't help but take it as a challenge... :P
This was the query I used. There's a lot of false positives, but it's far easier to look through these than the whole transcript... :P
 
Still best Java answer:
Jun 24 at 0:50, by Geobits
@DrGreenEggsandIronMan Finally! Java, 0 bytes:
 
CMC: Find longest Java code on whole SE
 
I tried using a regex search...
 
NOT JUST PPCG! whole SE communities.
 
Woah. Let me adjust my volume....
 
4:27 PM
I don't know how some brains can produce this much of humor ...
 
#Java, Aleph null bytes

class JavaIsNotVerboseAndIKnowItThisIsTheMostGolfedCodeOnEarthReachingAlephNullBytesPleaseDontJudgeJava...
 
@Geobits Seriously?
 
I was not able to copy-paste the whole text ^^ But it is the longest Java code in the whole of SE
 
I mean I knew you said you would change your avatar for the design but...
 
Hey, why not stay updated? :D
 
4:28 PM
@Geobits hey, I remember that CMC! lol
 
hi @Dennis
 
o/
 
@Dennis another question.. for the permanent computation, if you have 100 cores could it be parallelised well?
I ask as I am looking into a GPU implementation
and I was trying to understand how you have parallelised it
 
@Lembik What are you doing that requires calculating permanents?
 
@feersum There is a problem in physics where computing the permanent gives you a probability
 
4:34 PM
What, a boson thingy?
 
I know nothing about physics but am just playing
@feersum yes
@feersum good knowledge :)
 
hahaha
 
@feersum quantum majik
 
How does your playing become more fun if you can calculate n=40 versus n=20?
 
I read somewhere that it can't be done for n = 30 :)
well that it can't done quickly for n = 30
 
4:36 PM
@Lembik Sure. Using popcounts, each summand of the formula can be computed independently. With gray codes, you'd have to split the range in equal parts.
 
@Dennis oh cool. It's the splitting into equal parts which I was worried about but I suppose that should be ok
now I just have to learn how to code in cuda :)
 
Anyone else have unposted Sandbox challenges? meta.codegolf.stackexchange.com/…
 
@Lembik No clue how different CPU and GPU programming is.
 
@Dennis me neither except that on a GPU we are looking for 1000 fold parallelisation
 
0
A: Sandbox for Proposed Challenges

TùxCräftîñgThe number 3 is cursed; avoid it code-golf Inspired from this It's well know that the number 3 may lead to weird bugs in a program. So your task is to write a program to remove every literal 3 (only the base 10 number; not a 3 in a string, a variable name, a longer number or with a different b...

 
4:39 PM
@Dennis so you have to be able to partition the problem
 
@mbomb007 I have nine.
 
I've got some pretty old ones.
One is from 2015.
 
If I could work out how to do it, I would like to see some GPU coding challenges on ppcg
 
er...I have 22 unposted challenges
 
@Lembik Ew. I wrote some CUDA in college. It was gross. (Not as gross as Android, though)
 
4:40 PM
@El'endiaStarman Me too. At least two of them are not viable though.
 
@mbomb007 everything is beautiful on ppcg :)
maybe it is nicer now? I don't know what has changed
 
oiler v is here
 
@Lembik Probably not. You still have to chop your problem into blocks for parallelization. It's not the language that's the problem, it's the principle.
 
@Zgarb The most iffy one of mine is the "implement an SR NOR latch in Game of Life".
 
@mbomb007 got you.. to be fair a lot of things that happen on ppcg would be regarded as horrible by someone :)
 
4:42 PM
@Oliver I think you mean "Lorevi"
 
@El'endiaStarman That's not that hard. Logic gates already exist...
 
@mbomb007 I got 2.
 
I also have 2
 
I have 6. One of them is a terrible idea.
 
@El'endiaStarman I have "make a generalized array indexing operator" popcon... :P
 
4:43 PM
I've got 7.
 
Oh, speaking of challenges, does anyone know if we already have a challenge about whether you can fit one rectangle inside another, with any orientation?
 
@El'endiaStarman nice idea
 
@El'endiaStarman I remember something similar...
I might have been with more than one rectangle
 
One of mine has a fundamentally flawed scoring method (and the idea itself is rather weird), the other a potential duplicate (never received feedback regarding that).
 
oh shit, I'm code-golf gold now, my dupe vtc auto closes, this is scary
 
4:44 PM
we should have a "Can you get the sofa round the corner " challenge too :)
 
@Maltysen Welcome to (part of) the mod life. :P
 
The moving sofa problem or sofa problem is a two-dimensional idealisation of real-life furniture-moving problems, and asks for the rigid two-dimensional shape of largest area A that can be maneuvered through an L-shaped planar region with legs of unit width. The area A thus obtained is referred to as the sofa constant. The exact value of the sofa constant is an open problem. == History == The first formal publication was by the Austrian-Canadian mathematician Leo Moser in 1966, although there had been many informal mentions before that date. == Lower and upper bounds == Work has been do...
 
That gif...
 
@Lembik Now do that in 3D while going up a staircase.
 
"sofa constant"
 
4:45 PM
:) It would be great if it could be phrased as an optimization problem
 
I'll go at the top. Trust me, I won't jump on the sofa half-way up.
 
which I suspect it could
 
0
Q: Encode the simple substitution cipher

OliverReview First, let's review the Simple Substitution Cipher. To encode a string in the Simple Substitution Cipher, replace each letter in your string with another letter. A letter may not be used to replace more than one existing letter. For example, if I was encoding the text Hello world, my ...

 
huh, I found this challenge I posted a while ago
0
A: Sandbox for Proposed Challenges

Nathan MerrillSubstitution Cipher Programming A substitution cipher maps each unique character text of string to another character. If my substitution cipher is [H->6, e->U, l->V, o->)], then Hello becomes 6UVV). You must write a program A, which takes A as input, and prints out a B, after having passed it ...

 
**CHAT CHALLENGE!** Funniest fill in the blank:

With great power comes great _______.
 
4:47 PM
quack
 
Also, weirdest thing I've seen in a while: Woman Badly Burned After Farting During Surgery
 
@mbomb007 eleven
 
@mbomb007 system crashes
 
are we playing chat madlibs
 
@mbomb007 responsibility
</anti-joke>
 
4:49 PM
@mbomb007 root
 
@mbomb007 current*voltage
 
Outages.
 
@mbomb007 Verboseness
 
Megalomania
 
logarithm
4
 
4:51 PM
@NewMainPosts This is one of the cases where I'd rather close the older challenge as a duplicate of the new one. Any objections?
 
Whaddaya say @NewMainPosts? Why is he so quiet?
 
That was for context. >_>
 
@Dennis Agreed
 
How do you create a chat bot?
 
@Dennis oooooh can I do it?, I want to exercise my partial-mod powers
 
4:53 PM
1. Don't.
 
@KritixiLithos with magic
 
1. Put on metal suit. 2. Start typing.
2
 
@mbomb007 scott!
 
Just for fun, for example in SE's Sandbox room
 
[:|]
 
4:54 PM
@Maltysen Sure, go ahead.
 
@Dennis kewl
 
@mbomb007 _______
 
@mbomb007 reference to Back to the Future
 
@Dennis "This question does not have an upvoted or accepted answer"
not letting me dupe the other one
 
do I won? :P
 
4:55 PM
@mbomb007 you don't say :O
 
Q: Bored to death. Any ideas?
 
@GLASSIC Make a golflang
 
I'm not sure what ideas I could give a dead person.
 
Or go outside Ugh
 
C## - golfed version of C#
 
4:56 PM
@GLASSIC Well, today is the Day of the Dead...
 
@Maltysen With great power comes great eleven.
 
@TuxCopter OK so I just started to make a compiler for a random one
 
@KritixiLithos carefully
 
@Dennis Is that a reference to "Stranger things"?
 
@TuxCopter hey! That's my joke :p
 
4:56 PM
@Dennis o
 
@Lembik TNB meta
 
@Lembik I don't know what that is.
 
Stranger Things is slowly ruining "eleven".
 
Stranger Things is an American science fiction-horror web television series created by the Duffer Brothers. It is written and directed by Matt and Ross Duffer and executive-produced by Shawn Levy. It stars Winona Ryder, David Harbour, Finn Wolfhard, Millie Bobby Brown, Gaten Matarazzo, Caleb McLaughlin, Natalia Dyer, Charlie Heaton, Cara Buono, Matthew Modine, Noah Schnapp, Joe Keery, Sadie Sink, and Dacre Montgomery. The plot follows the disappearance of a young boy, and a telekinetic girl, who helps his friends in their search, while the boy's older brother, his mother, and the town police chief...
 
Stranger than what?
 
Anonymous
4:57 PM
@Lembik No, it's a reference to mod abuse eleven
 
fiction
 
it's pretty good
 
Anonymous
@Geobits No that's Will Ferrell
 
No, it's a reference to guitar amps.
 
I really liked it.
 
4:57 PM
@betseg ₥ʍɐηɐηα
 
@Mego ok...I have no idea what "mod abuse eleven" means
 
@TuxCopter wat
 
@mbomb007 With great power comes great electric bill
 
@betseg What is TNB?
 
4:58 PM
@betseg ʍɐʈ
 
@Lembik The Nineteenth Byte
 
@TuxCopter No Seriously, how?
 
@Lembik The Nineteenth Byte
 
@KritixiLithos very carefully
 
4:59 PM
thanks!
I think it was better from "Stranger things" :)
 
@Dennis Ah
 

« first day (2104 days earlier)      last day (2746 days later) »