« first day (1832 days earlier)      last day (3013 days later) » 

10:00 PM
We've run out of ways to style the disapproval face, so there's no other option.
 
@AlexA. I wouldn't know, I've never played
 
It ... really hasn't stood the test of time.
 
I just saw a pattern that wasn't in OEIS somehow, so I had to continue
 
hahaha
 
I've never played anything in the following series: Doom, Quake, and Half-Life. Both Portal games though
 
10:01 PM
@AlexA. I mean, we could ಠ_ಠ or something. Maybe.
Huh. ಠ_ಠ not in code is pretty much the exact same thing as ಠ_ಠ in code.
 
Heh, I had to enter edit mode on your message to see how it was different.
ಠ_ಠ
 
ಠ_ಠ
 
ಠ_ಠ
 
yo
 
10:03 PM
ಠ_ಠ
 
@Quill ಠ_ಠ
 
@Doorknob Yeah, it's pretty crazy. So subtle, too.
 
@Doorknob 8 space indents? Unimpressed.
 
Thanks, SE
 
need the http
 
10:04 PM
@AlexA. s
 
@AlexA. Thanks
 
@mbomb007 If you prefer your disapproval looks to be secure, then yes. :P
@Roujo Anything to further the disapproval.
 
There, fixed
Hmmm, can you even style links with bold, italics and strikethrough...
 
@Roujo Hovering the mouse over the link makes the mouth wide. :D
3
 
We may just yet have our OEIS sequence
 
10:06 PM
The fun part is that every formatting option doubles the amount of disapproval we can get
@mbomb007 Nah, we did that one already
So I spent half and hour or so (cumulatively) to answer a SO post, commenting and replying to the guy to understand what he wants and edit accordingly, and I think he just left when he got what he wanted. =P
That was my first SO post ever, so I guess I should get used to it?
 
@Roujo have you done > quotes yet
 
@Doorknob No
 
@Doorknob Mother of god
 
@Roujo Pretty much. If it's any consolation, I have like twice the number of required answers for a certain tag badge on SO but only about a quarter of the required answer score for it.
 
@AlexA. Ouch =P
 
10:10 PM
And the Unsung Hero badge
 
@Doorknob Very cool.
 
> Zero score accepted answers: more than 10 and 25% of total
 
@Roujo x no score accepted answers and 25% of your accepted answers have no score or something like that
ninja'd twice
 
Yep, SO likes giving those out. Over 12k of them.
 
10:13 PM
@quartata Obtain a state of wreckedness, son in law.
3
 
So it appears that we have not had a pure n-queens code-golf
We've had a pop-con, one with no objective winning criteria and a weird one
This is surprising
 
Well he didn't even accept the answer, so I can't even start working on getting that badge either =P
@quartata Link to the weird one please? =)
 
@quartata Link to all of them please
=)
 
6
Q: N-queen-and-equine quine

coredumpThere is a variant of the well-known N-queens problem which involves queens and knights and is said to be "considerably more difficult" 1. The problem statement is as follows: You must place an equal number of knights ♞ and queens ♛ on a chessboard such that no piece attacks any other piece...

weird one
 
Link to every question ever please. =)
 
10:14 PM
10
Q: N-Queens problem

Dan McGrathIn chess, a queen can move as far as as the board extends horizontally, vertically, or diagonally. Given a NxN sized chessboard, print out how many possible positions N queens can be placed on the board and not be able to hit each other in 1 move.

dumb one
5
Q: n-queens problem, displaying more than one solution available

Abie Giordanoas some of you may know, n-queens problem is a set of algorithm puzzle that given a 'n x n' where n is the board size of a (let's say) chessboard, and the main goal is for the n queens (where n is the number of the queens) not be able to 'attack' one another in the board. now I have a set of con...

popcon one
 
@El'endiaStarman 1, 2, 3, ...
 
@Geobits Those are all the same link.
 
Umm... no they're not? >_>
 
@Geobits Huh, well that's mighty strange <_<
 
10:16 PM
@Roujo 404
@Geobits Good, good, three down, 4865 more to go! (Undeleted.)
 
Let me write a script...
I don't think the mods are gonna like this...
 
Anonymous
@Geobits See you in 3 hours
 
@El'endiaStarman Well yeah, you have to expand it. =P
 
@Geobits ಠ_ಠ
 
You don't have to cry.
 
10:18 PM
@Geobits Also keep in mind that they must actually be links to questions.
 
Yes I do
 
@El'endiaStarman What else would they be links to? I can see deleted ones anyway.
You said every question ever.
 
@Geobits For example, "question" 5.
 
Oh, that's odd.
Still, should be easy to filter, but it means I actually have to visit each one, so this might take a bit longer to run..
 
Sure. Query the URL, then filter if the response has a different number after "/questions/".
 
Oh, you're actually going to do it. Have fun! =D
 
Still does it
Weird
 
It looks like it just uses post number as q number too.
 
Right, because PostId is what they use to distinguish posts and it corresponds to any post, regardless of the type
PostTypeId gives the type
(thinking in terms of SEDE)
 
I was actually thinking that correctness would be established by comparing with the SEDE.
 
10:22 PM
So we've had a total of 71137 posts so far I guess.
It would probably be easier to just query SEDE by PostTypeId to make the list.
 
@El'endiaStarman SEDE doesn't have an API though (by design), so it'd have to be a manual check
@Geobits Yeah
 
right
Or at least a copy-paste.
 
Yea, that's what I meant.
 
@quartata If you're writing it up, will it be number of solutions or list all solutions?
 
Mmm, pasta
Mmm, paste
 
10:24 PM
Mmm, copy
 
In my first office job, I shared an office with a copier. I grew to enjoy the smell of copier toner.
 
Mmm, ಠ_ಠ
 
@MartinBüttner So this SO question you answered a while ago got a newer answer, and I can't get the regex to work the same he claims, but in Retina.
 
Sorry @AlexA., and thanks @Lynn...
 
10:40 PM
¡×ẋI$⁸l?®JoL/ƲƝ
> JoL
> > JoLf
Jolfeezlifeconfirmed
 
@Doᴡɴɢᴏᴀᴛ the vote buttons for the userscript are missing.
Oh, no more nvm.
They are gone?
 
Is "SMBF" an acceptable name for "Self-modifying Brainf***" in challenges where the score includes the name?
 
If the acronym may not be well known, you could always make it a link
 
That's true, I guess.
It's not that well-known of a language.
 
10:52 PM
TIL you should always, always, always use for(var i...). NEVER leave off the var . I spent 10 minute debugging a simple error. (JavaScript.)
 
TIL you should always, always, always not use JavaScript.
 
^
 
^
2 mins ago, by RikerW
http://jelly.tryitonline.net/#code=4oCcwqHDl-G6i0kk4oG4bD_CrkpvTC_Gssadwrs&input‌​=
 
TIL you should always, always carrot JS-bashing.
4
 
@AlexA. read ^^
^^
 
10:53 PM
I did
 
@AlexA. TIL you always, always, always have to use JavaScript if you want to do anything remotely interesting on a website.
2
 
@Alex: ಠ_ಠ. @Adnan: ಠ_ಠ. @RikerW: ಠ_ಠ
 
@Geobits BUT YOU DIDN'T???
 
I know. It was a horrible mistake, that's how I learned.
 
reloads shotgun.
 
10:54 PM
@El'endiaStarman ¯\_(ツ)_/¯
 
@ETHproductions I added string compression to Jolf!
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Who what where when why?
 
that's what I was debugging
 
JavaScript has many flaws. It is also the only option. ¯\_(ツ)_/¯
 
@RikerW This reminds me to implement sentence case
 
10:55 PM
@El'endiaStarman All languages have flaws, but JavaScript has an unusually high amount...
 
Agreed.
 
@ThomasKwa List of solutions but I haven't started writing it yet
 
My personal favorite: [1,2]+[3,4] => "1,23,4".
 
I wonder why no one has adopted an alternative to JavaScript for web stuff.
 
@RikerW Who: Anyone who dareth speaketh against the wholly javascript. What: The shotgun. Where: In the conservatory. When: Now. Why? No idea.
 
10:56 PM
> wholly
 
> wholly
 
@AlexA. many, many people have
 
ninja'ed
 
e.g. coffescript
 
@El'endiaStarman HAHAHAHAHA
 
10:56 PM
Which compiles to JS :P
 
@El'endiaStarman I'm not going to say "holy" now am I? :P
 
@Maltysen If you say jQuery or coffeescript I will get quill to kill you.
 
He already did say CoffeeScript
 
He will for jQuery, IDK coffeescript.
 
@Maltysen Not really. Most of them either suck or transpile to JS
 
10:57 PM
^
 
none of them are real solutions
 
@AlexA. not helping?
@CᴏɴᴏʀO'Bʀɪᴇɴ jelly.tryitonline.net/…
 
For an alternative to be accepted, it has to be supported by browsers.
 
YOU JUST SENT THAT. ^^
 
proof?
 
10:57 PM
@El'endiaStarman or a language with a JS interpreter
 
@El'endiaStarman Right. I feel like if they wanted to Mozilla could pull it off with Firefox and other browsers would follow suit.
 
@quartata Debatable whether that's still using JS.
 
I'd call CoffeeScript still using JS
 
0
A: Sandbox for Proposed Challenges

Zach GatesTask Write a program or function that will determine if a point in 3D space lies on a 2D parabolic curve. Input 3 points in 3D space vertex of a 2D parabola curve arbitrary point on the curve arbitrary point in space Input may be taken in any form (hardcoded, string, array, etc). Outp...

 
@NewSandboxedPosts I'm excited about this one :)
 
11:00 PM
@El'endiaStarman My personal favorite (albeit, a little obscure): a=[4,3,2,1];eval("a["+a+"]") => 3
 
0
Q: Shortest code to cycle through RGB LEDs

George StockerGiven four RGB LEDs, your task is to cycle through all the LEDs, with one Color Per LED, and only one LED displaying a color at a time. So for 8 colors across 4 LEDs, it would look like this: LED1 LED2 LED3 LED4 0xFF,0x0,0x0 OFF OFF OFF OF...

 
@NewMainPosts what is up with all the new users? o_O
 
@MartinBüttner Nvm.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ what kind of string compression
 
@quartata Shoco, for the moment.
I plan on adding a lot of different types to Jolf to get the string compression edge.
Huffman coding looks promising.
 
11:03 PM
@ZachGates Why by chars?
 
Huffman coding relies on an existing text.
 
@El'endiaStarman I thought it just relied on a predefined character frequency...
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Is it because JS sees a as being truthy and therefore evaluates a[1]?
 
@El'endiaStarman Nope. Comma operator.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Well, yes, you're right. Those are usually calculated by looking at an existing text.
 
11:04 PM
@ZachGates I can't tell what language may win yet. Which is a good sign.
 
@ThomasKwa I imagine some of the programs will get quite long (even in golfing languages). Characters that take up 2, 3, 4 bytes will add up
 
@CᴏɴᴏʀO'Bʀɪᴇɴ ......what? Comma operator? o.O
 
@El'endiaStarman val,val,...,valQ = valQ
 
....huh
 
> 1, 2, 3, 4
< 4
 
11:05 PM
weird
 
@ZachGates I don't follow.
 
So [4,3,2,1][4,3,2,1] => [4,3,2,1][1] = 3.
 
@ThomasKwa Yeah, at second thought, byte-scoring makes more sense
 
That's why it's my personal "favorite": it shows JS's "uniqueness" and its insanity
 
Huffman coding is only effective really when you know what your input will usually look like
 
11:05 PM
@CᴏɴᴏʀO'Bʀɪᴇɴ Good choice. :P
^^
It's good as a targeted encoding, so to speak.
 
But you generally have to design it for specific use-cases, or transmit the bits-to-symbol table along with the code.
 
it can be good for compressing code in a certain language
 
Well, I guess that's out of the question/
@quartata Jelly compressor :D
 
It took me a couple hours to wrap my head around the transposing of a 3D line through space to a 2D graph. It's a pretty difficult challenge, IMO. Especially determining the parabolic equation (a quadratic), because you have to solve a 3x3 linear system.
Or use a matrix
 
11:09 PM
Jelly can do it ten bytes, prolly :P
 
You either have to solve a 3x3 system of equations algebraically, or use a 3x3 matrix to do that (which requires multiplying by the inverse of the matrix).
 
Wait, the vertex and a point on the parabola isn't good enough. You can rotate the parabola.
 
0
Q: Fibonacci-style matrix expansion

Digital TraumaFor each row and column of a matrix, we can add an extra entry with the sum of the last two entries in that row or column. For example with the following input matrix: [ 1 1 1 ] [ 2 3 4 ] The resulting matrix would be: [ 1 1 1 2 ] [ 2 3 4 7 ] [ 3 4 5 9 ] Given an input of an integer N and ...

 
You need three points on the parabola.
 
@El'endiaStarman You only need two. See the walkthrough
 
11:14 PM
@El'endiaStarman Right, a rotation combined with change in curve still has the two points
Wait
 
@ZachGates I did. Look at the "triangle" in the first picture. You can rotate one of the endpoints about the axis formed by the other two points and the parabola will be the same.
 
I think there might even be two degrees of freedom
 
Oh....yeah, I think you're right.
Wow.
 
With vertex 0,0 and point 0,1 there could be the parabola pointing NE that contains 1,0
 
> You may assume that the parabola will always be vertical (continuing downwards).
 
11:17 PM
or the parabola pointing NNE that contains cis 45°
 
@ZachGates Oh, didn't see that.
 
@El'endiaStarman I only added it a few minutes ago
 
ahh, okay
Well, it's not so hard anymore. You can rotate by the angle of the x-y line to make it lie on the x-z plane and check to see if the third point lies on the parabola.
I think that's just the right hardness though.
A 4 or 5 on the Mohs PPCG scale of hardness. :P
 
PPCG scale of hardness:

1. Hello, World!
2. Primality testing
3. Look and say sequence
4. ???
 
FizzBuzz?
 
11:23 PM
... 10. "Prove N = NP."
 
@CᴏɴᴏʀO'Bʀɪᴇɴ *P = NP
 
FizzBuzz is about 1.5 on that scale
 
@CᴏɴᴏʀO'Bʀɪᴇɴ No, that's about 1,000,000.
10 would be like Counting Diamond Tilings.
 
@quartata No, N = NP. It's a less-well-known equation.
 
10. Simulate a Game of Life simulation of Tetris
 
11:24 PM
@Sp3000 That's more like 20 o-O
 
I think 7 would be:
3
Q: Fibonacci-style matrix expansion

Digital TraumaFor each row and then column of a matrix, we can add an extra entry with the sum of the last two entries in that row or column. For example with the following input matrix: [ 1 1 1 ] [ 2 3 4 ] The resulting matrix would be: [ 1 1 1 2 ] [ 2 3 4 7 ] [ 3 4 5 9 ] Given an input of an integer N...

 
@CᴏɴᴏʀO'Bʀɪᴇɴ ? there's no complexity class N
@Sp3000 I'd say that's a 10 yeah
 
@quartata There is. It's a less-well-known class.
 
the PPCG Hardness scale should be judged on how long it takes Dennis to solve it
 
11:25 PM
@GamrCorps Everything is either 0 or infinity tho...
 
@CᴏɴᴏʀO'Bʀɪᴇɴ true
 
On a completely different topic, I'd like some thoughts on this: let's say I have a function \cycle that...well...turns the input into a cycle. So \cycle([0,1]) becomes [0,1,0,1,0,1,...] and likewise \cycle([2,3]) becomes [2,3,2,3,2,3,...], both of which are infinite lists. The question: what should \cycle([ \cycle([0,1]), \cycle([2,3]) ]) be? Or, alternatively, if you loop through it with a for loop and print each item, what should the output be?
 
Or -1, for closed challenges :P
@El'endiaStarman There is no topic. XD
 
@CᴏɴᴏʀO'Bʀɪᴇɴ *off-topic topic
 
@GamrCorps Or how long it took Calvin to write the challenge
 
11:26 PM
@El'endiaStarman Bot hwork
^^
 
@ZachGates lol
 
> Bot hwork
 
@CᴏɴᴏʀO'Bʀɪᴇɴ I felt stupid for a second until a quick Wikipedia search assured me that it either doesn't exist or is obscure enough for me either to have not known or to have forgotten
phew
 
@quartata I'm entirely serious just kidding.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ ok good
 
11:29 PM
But I'm serious about the P > NP equation.
"serious"
 
@El'endiaStarman Alternate picking from which seq
 
@Sp3000 What about \cycle([ [0,1], [2,3] ])? I'd expect that to be [[0,1], [2,3], [0,1], [2,3], ...].
I guess the rules can be different for infinite lists.
 
@El'endiaStarman It should be [[0,1,0,1,..],[2,3,2,3,..],[0,1,0,1,..],[2,3,2,3,..],..]
An infinite 2D array.
 
^
 
@Zgarb Sure, but that's a bit difficult to loop through with a for loop. At least, naively.
I could do the diagonal trick.
 
11:32 PM
@El'endiaStarman Then don't do it naively. ;)
 
Or some variation thereof.
 
 
This would be easier, just nested loops.
 
I think infinite lists in PyAcidic might turn out to be quite useful.
Print the calendar days of a year? \printLines(\chunk(\splice( \map(\firstN(\N,_), [31,29,31,30,31,30,31,31,30,31,30,31])), \cycle([7]))
(Assumes Jan 1 is a Sunday.)
 
11:43 PM
@El'endiaStarman Will PyAcidic have lazy evaluation?
 
Probably.
Actually, almost certainly.
Kinda hard to not lazily evaluate infinite lists. :P
They'll be much like generators in Python.
 
Yeah, kinda. =P
Well I guess it's easy to do. It's the "and then do anything else" part that requires the lazyness
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Feeling a little sleepy now? :P
But other than that, I dunno what you're trying to point out.
 
ZZ Top /ˈziːziːtɒp/ is an American rock band that formed in 1969 in Houston, Texas. The band comprises guitarist and lead vocalist Billy Gibbons (the band's leader, main lyricist, and musical arranger), bassist and co-lead vocalist Dusty Hill, and drummer Frank Beard. One of the few major label recording groups to have held the same lineup for more than 40 years, ZZ Top has been praised by critics and fellow musicians alike for their technical mastery. Of the group, music writer Cub Koda said, "As genuine roots musicians, they have few peers; Gibbons is one of America's finest blues guitarists...
 
11:47 PM
@El'endiaStarman Yes, I am :3
 
oh, haha
 
@Roujo And thank you!
 
When Downgoat and DigitalTrauma are next to each other in the users grid, I feel like they should cancel out.
 
@Zgarb Like 2048?
 
Or like I'm calculating a sum and can just cross out both.
 
11:49 PM
But what do you get if you upvote a downward goat?
I don't know that it would sum to 0
 
It'd probably end up being an upward goat missing a leg. Maybe.
 
That seems reasonable.
 
Which would then be slanted, then fat, then slanted and fat.
Then crossed out somehow, too.
 
And then turned into code.
 
Unsuccesfuly, alas
 
11:55 PM
¯\_(ツ)_/¯ Good enough
 
We need a zero goat
 
Do we though?
Wait, wouldn't that just be no goat at all?
 
It's the difference between 0 and null
 
Nullgoat
 
A null goat points to the sky.
 
11:56 PM
A zero goat is the knowledge of a goat that isn't there.
A null goat is an absence of a goat that we know and miss.
 
So Downgoat whenever he isn't in the room?
2
 
Basically, yes
Careful, you might reference him by accident
 
> You have fully used your vote allowance for today
F&&&&
 
2 minutes until UTC midnight
 
Then again, it's a choice you make
 
11:58 PM
> Example: Apple Juice from Apples
 
@AlexA. Bottle of apple juice?
 
Where else would apple juice come from?!
 
Or you don't reference him and risk having him harvested by the GC
 
GamerCorps?
 
11:59 PM
what
 
@Roujo Future ping! :O
 
D:
 

« first day (1832 days earlier)      last day (3013 days later) »