« first day (1729 days earlier)      last day (3115 days later) » 

12:00 AM
Do you think Windows ME was the best OS ever?
 
> screaming-fast at over 5 MHz.
 
No way, that's too fast. You're making that up :P
 
> In 2010, Ask.com abandoned the search industry, with the loss of 130 search engineering jobs, because it could not compete against more popular search engines such as Google.
 
12:01 AM
I wish I was. It really is too fast.
 
I got it for free. The company my dad works for decided they didn't need it anymore.
 
@El'endiaStarman They existed all the way until 2010? That's honestly kind of amazing to me.
I thought they fell into irrelevance long before that.
 
They were definitely on the way out. That was just when they threw in the towel for good.
 
@DigitalTrauma: It's not that old.
 
@El'endiaStarman My favorite description of it was from the show Parks and Recreation: "You ask a fake butler to Google things for you."
 
12:04 AM
Bing
>.<
 
Someone asked Bill Gates what we're all thinking: "Does anyone actually use Bing? I mean really, come on."
 
@AlexA.: My mom does, occasionally.
 
ಠ_ಠ
 
@AlexA. Source? Reply?
 
Lol at the username Fozzy420.
I got the question phrasing slightly off but the sentiment is the same.
 
12:07 AM
Listening to this right now > youtube.com/watch?v=NA2KtP7xu6U
 
Listening to this right now > youtu.be/83gg3_gRZWQ
Mine's better. :P
 
Speaking of old computers, my girlfriend has one of these bad boys:
 
@AlexA.: I'll check it out in between this song and the next one on my playlist.
 
Good plan.
 
12:10 AM
Whoa
 
Whoa
 
^ What a lot of the Rosetta song sounds like.
 
Just "Whoa"? Haha
 
Well, the instrumental part is pretty good.
 
I absolutely love Rosetta's first two albums, The Galilean Satellites and Wake/Lift, but the ones after that don't do anything for me.
@SuperJedi224 Not a fan of the vocals?
 
12:13 AM
Not really.
 
Wait, there are vocals?
Huh, I guess so.
 
@SuperJedi224 Right around 2:45, shit gets crazy.
@El'endiaStarman Did you not notice or did you just not listen long enough?
 
Just finished the song.
 
And you didn't notice it had vocals? o.O
 
No, not really.
At least, they didn't register as vocals in my mind.
 
12:15 AM
What did you think that noise was?
 
[shrug] Guitar with a lot of distortion, perhaps?
I don't pick out instruments.
 
Ah, okay.
 
It's hard for me to do so.
 
Right, I just remembered.
 
12:18 AM
0
Q: Fifth grade math problem for the week: fully automated decoding of a Caesar cipher

Michael SternProposed question: My fifth-grade daughter is learning about codes and ciphers. She has reached the point of decoding a cyphertext that has been encoded with the Caesar cypher even where the offset is not provided in advance. Without computers this can be time-consuming, especially for long bloc...

 
0
A: Sandbox for Proposed Challenges

ColeWord Game KotH king-of-the-hill First of all, I don't know what this game is called (or if it even has a name), but it's a modification of a game I've played a few times on road trips, especially with my family. I'll be thinking of a better name. Any suggestions at all are very welcome. How It...

 
1
Q: 2D Inequalities

PyrrhaObjective Given a grid of numbers, fill in the inequalities. Assumptions The number of columns and rows in the grid are equal. The maximum size of the grid is 12x12. The grid only consists of integers 0-9. The output may contain a trailing newline. The input is exactly as written below, includ...

 
12:42 AM
Where is everyone?
 
Writing a Minkolang program for this.
 
Seattle
We're all hanging out but we forgot to invite you.
 
At least two kinds of people...
 
12:58 AM
 
Commit message: "yay"
Descriptive.
 
yeah working on that
see readme
also pull requests pls
gtg
 
Commit message: "some info"
Haha
 
Wasn't there a question that requested you add functionality to your language?
 
I wonder if this would be a good candidate for @PhiNotPi's KOTH server that runs on the RedHat web service thing.
@CᴏɴᴏʀO'Bʀɪᴇɴ Sounds familiar, yeah.
 
1:06 AM
I am unable to find it...
 
> ## simplified server for http://meta.codegolf.stackexchange.com/a/1332/16472
> ## wish me luck
Good luck @TheDoctor. :P
 
Well, good bye I guess.
 
Haha
If that's you saying bye because you're about to leave, @SuperJedi, then bye!
 
But if you're talking to The Doctor, who I can only assume has to leave to tend to his patients, I will not say bye just yet.
2
 
1:10 AM
0
A: Sandbox for Proposed Challenges

Michael SternFifth Grade Math Problem for the Week My fifth-grade daughter is learning about codes and ciphers. She has reached the point of decoding a cyphertext that has been encoded with the Caesar cypher even where the offset is not provided in advance. Without computers this can be time-consuming, espe...

 
@TheDoctor I think this would be a great candidate for Phi's server. You two should have a chat.
 
Huh. Losing to Perl by one byte.
On a question.
 
Perl is the worst.
 
@TheDoctor Is that a KOTH you are working on?
 
I've added auto-closing parentheticals to JavaScript :D
 
1:24 AM
@PhiNotPi I'm just writing the server
@AlexA. ???
 
@TheDoctor Would it be something that could be hosted on my server?
 
IDK its probably better suited for running locally so the KOTH scoring people can see the output
 
There's ways to host it on the website still, but then there's not much of an advantage.
 
@El'endiaStarman I get the feeling I can beat Minkolang with ><> on this one :)
 
1:40 AM
@El'endiaStarman i was confused, i thought you were losing by one byte in a popcon ;) ;) ;) ;) ;) ;) ;) ;)
 
Haha, no. I'll go ahead and note that I've significantly improved my score. It, however, doesn't finish, which is weird, so I'm debugging.
Golfed off 7 bytes. ^_^
 
@El'endiaStarman I'd be interested in understanding Minkolang better, particularly this "time dimension" business--maybe over in the esolangs chat?
 
Haha, how does this have 2 reopen votes?
 
Because the threshold for the close/reopen privilege is very low.
 
@feersum Don't worry, I didn't do that. I'm a good reviewer O^O
 
1:52 AM
@CᴏɴᴏʀO'Bʀɪᴇɴ Hmm, you replied defensively to my message directed at no one in particular. Very suspicious!
2
 
the most joy i have on this site is when i'm helping to close people's horrible questions
it's so satisfying
 
@feersum Uhhhhh runs away like a boss
 
Review history is actually public. :P
 
learns how to hack SO
Good night y'all!
 
G'night!
 
2:18 AM
"Walking on water and developing software from a specification are easy if both are frozen."
5
 
stars
@Sp3000 I see you got 64 bytes. Well, my answer is older so... :P
 
Actually, I posted 23 min before your last edit that got you to 64 :P
 
...crap.
2
 
Having said that, I don't think it'd be hard for you to beat it anyway :)
 
haha, yeah, continuing to golf off bytes...
 
2:26 AM
Does anyone want to write a simple bot for this that I can test my server with?
 
@Sp3000 Looks like you were right. Down to 60 bytes. :)
 
I think it could be much less if you switched approaches, but I don't know enough about how you've implemented Minkolang to know if I'm right
 
Switched approach how?
 
Have you tried working out how mine works? e.g. put -1 at ('p', 1)
 
That's a great approach.
...HMMM...
I do have access to an array that expands as needed.
AND I am able to put values to code places "out of bounds".
 
2:42 AM
If you're using a defaultdict and values are 0 by default, then that should be enough
 
I think default values are -1. Lemme check my implementation.
Oooh, no, it's 0!
 
I was thinking I'd be surprised if you did defaultdict(lambda:-1) :P
 
Haha, I don't do it quite that way.
...hmm. Great. Plain dictionaries are not JSON-serializable.
 
3:03 AM
Well I did it, I made AvaScript: vihanserver.tk/p/AvaScript
 
hah
 
@Vɪʜᴀɴ Example? :)
 
@Vɪʜᴀɴ ^^
@Vɪʜᴀɴ also making math = $, wouldn't that conflict with the jqueriers?
 
^
@El'endiaStarman Actually, the problem is that the keys of the out-of-bounds code dictionary are tuples, not strings.
 
cue that screenshot of adding integers with JQuery
 
3:17 AM
lolol
 
3:28 AM
@TheDoctor yeah it would, but you could probably fix that with jQuery
 
true
 
An example would be this
 
DANGIT @DLosc! I have a 44-byte Minkolang answer and you just HAD to go and undercut me!!!
Now I'm regretting calling attention to that question...
 
:P I had 40 btw
 
3:38 AM
@Sp3000 [glowers]
 
hai @Doorknob
 
@Sp3000 40 bytes in ><>?
 
@TheDoctor hai
 
@El'endiaStarman something smells ><>y
 
@El'endiaStarman Ahaha no, Gol><> port of ><> (I actually did the Gol><> one first, which was why I was confident I could temporarily beat you in ><> :P)
 
3:39 AM
Ahhh... -_-
 
what's gol><>?
 
Sp3000's golfing version of ><>.
It tends to do better than Minkolang by a couple bytes.
 
^^ that, mainly because ><> doesn't have integer input and it annoys the heck out of me
 
We haven't taken a crack at any particularly complex questions where Minkolang would probably win out.
@Sp3000 That was also part of my motivation to make Minkolang. :P
 
I think I tried JARVIS and you beat me by a few there
 
3:41 AM
golfing languages >_>
 
* golfing golf-ish
 
I don't know about Minko, but Gol><> perfectly preserves the fact that ><> sucks at string questions
 
@Sp3000 Ahhh. Woo, +1 for Minkolang! :P
@Sp3000 .....example? I'm not totally sure either.
I haven't really tried any.
 
e.g. just check if a string is a substring of another string
 
3:46 AM
hmmmm...
Yeah, there's no quick way to do that in Minkolang.
...wait, there might be if I use recursion.
hmm
 
I mean, you could always define it as a builtin, but I'd prefer figuring out a way of doing that general class of problems well, rather than that specific problem
 
@El'endiaStarman If it makes you feel better, I upvoted yours first. I don't really know how it works, but it's pretty impressive.
 
@DLosc I've updated the answer and accordingly the explanation.
 
@El'endiaStarman Whoa--you've got an interleave command??
 
3:49 AM
You know, seeing your 13359"QRBNP" on the first line makes me think I might be able to shave a few bytes...
 
Yup! ^_^
@Sp3000 -5 bytes! Nice!
 
That saved a lot more than I thought it would
 
Hmm. I think I could implement a ternary command.
 
... hang on, I've got this backwards. Might be able to save a few more
 
Now to answer this challenge with my newly-developed esolang, Ouroboros. =^D
 
3:59 AM
That sounds fun!
 
Trying to port the idea means that now I... tie with Pip. Yay?
 
Lol, so you saved 1 byte? :P
 
All that for 1 byte :P
 
bahaha
So you're beating me by 5 bytes.
Speaking of which, how come you haven't posted your Gol><> answer?
 
Didn't think it was that interesting since I could just do it in normal ><> the same way
 
4:04 AM
ah
Oh hey, golfed off two bytes!
 
I think that's about as low I can go with ><>
 
Very nice.
 
Hmm I guess I could shave a few with exiting on error (most ><> solutions could probably do that) but I dunno, not really a big fan of it
 
If I can figure out how to negate the scores AND lowercase the letters before merging, that might save a few bytes.
Oh hey! Saved another byte by changing the loop! :P
Wow. Meteoric descent from 72 bytes to 41. :P
And some 16 bytes of that 31 byte difference is due to Sp3000. Wow.
 
Well as they say, it's one thing to golf minor things here and there, but it's another to revamp your whole algorithm and shave a ton at once
 
4:18 AM
yeah
 
Just tried a different approach in Pip but the lowest I could get was 40. Too bad that King is in there.
 
Uh...can't you just leave out the king?
That'd take off two bytes.
 
^^ that's what I was wondering
 
You mean in my current solution?
 
4:22 AM
Yeah, since that'd give nil right?
 
The trouble is that nil isn't a valid index. I have to turn it into an actual number with |.
But since 0 is also falsey, the | operation affects an index of 0 too.
So the 0th element of the lookup string has to be something that has a score of 0. It could be anything, but I put K in there because it looked nice.
 
ahh, so you have to offset the first index
 
Right.
 
Ah, right :/
 
I could alternately increment it so every real index is > 0, but that would cost more bytes.
Haven't implemented a null-coalescing operator, though I'm thinking about it.
OTOH, in this example, such an operator wouldn't save any bytes if it were two characters, which it probably will be.
Hmm... though the letters DGHK are still available... Maybe call it the nil-'K'oalescing operator? :P
 
4:30 AM
As a reference point: CJam is <= 33
 
:P
 
Although I probably should be happy that Minkolang is within 1.5*Cjam. :P
 
Now I need another question :P
(while I wait for Dennis to come on and smash 33)
 
4:54 AM
0
Q: Remove the first letter of a string from the entire string

GamrCorpsThis is a simple challenge: Given an input string only containing the characters A-Z, a-z, and spaces, remove all occurrences of the uppercase and lowercase versions of the first character of the string (if the first character is A remove all As and as, if the first character is (space) remove al...

 
5:15 AM
I probably should of called AvaScript, TeaScript, that sounds a lot better than "AvaScript"
I'm going to have to rename so many files ;-;
 
$ rename 's/AvaScript/TeaScript/' *
if you have zsh, you can also automatically descend into all subdirs with **
 
I've never heard of a rename function...
hm
The amount of links I just broke ><
 
RewriteRule ^AvaScript/(.*) /TeaScript/$1 [R=301,NC,L] I hope this'll fix it
 
@Sp3000 If there's a way to beat 33 in CJam, it's really hard to find...
 
5:43 AM
@Sp3000: I had the bright idea of base-encoding the characters and their scores. Well...the resulting base-10 string is longer than the code...
 
C++11 puzzle: Invoke the explicit vector (size_type n); constructor (reference) without constructing more than one vector.
 
Nevermind. :P
 
@Dennis Not really hard to find, then?
 
@feersum would std::vector<bacon> bacon_vector(1000u); suffice?
 
@DLosc Not at all. Only took me an hour. :P
 
5:55 AM
@es1024 Oops, I forgot to specify vector<int>.
 
[weeps at losing a challenge]
 
That wouldn't work anyway as it declares a function.
Vexing parses and all that.
 
@Sp3000 - came up with another method that I think is particularly clever. 13359$d5[0g~]I"qrbnpQRBNP"m[0p]$I[o0q+]N.
It pushes the scores, duplicates the stack, negates half of them, pushes the length of the stack, pushes the characters, merges them, and then does the loop that puts the scores in their respective spots.
 
@feersum std::vector<int> int_vector(1000u); isn't ambiguous for parsing, since 1000u can't be interpreted as a type
 
This works because in a merge, the larger half of an odd-length split is the first half, so after the merge, the length of stack is at the top. Hence, I don't have to do 25* or I2:, thus saving two bytes!
 
6:04 AM
@El'endiaStarman Ahh. That is clever.
 
Unfortunately, no bytes saved overall. Sadface.
 
@es1024 Right...that puzzle was too easy, hehe.
 
6:20 AM
Ouroboros scores an 82 on the FEN question. Not bad for a language that was designed to be more bizarre than golfy.
0
A: Evaluating the score based from a chess FEN string

DLoscOuroboros, 82 Ouroboros is an esolang I designed this week. Time to take it for a spin! i.1+!57*(\m1(M\1).96>.@32*-.80=\.78=3*\.66=3*\.82=5*\81=9*++++\2*1\-*+ )L!4*(4Sn1( Each line of single-char commands1 represents an ouroboros snake, wherein execution proceeds from head (start) to tail (en...

 
Wow, that's confusing. :P
Also, @DLosc, Minkolang actually can do numbers straightforwardly. You just have to use single quotes, like so: '123'.
Many times, for golfing, this is not totally helpful.
There was one answer to a chat mini-challenge where I used it to good effect.
 
@El'endiaStarman It takes some thought to figure out how to do stuff when the only control flow operator is adjusting where a snake's loop ends. This answer uses most of the standard idioms I've come up with.
 
Reading the readme now. :)
[sees first illustration]....what the heck.
Ahh...I think I'm getting the idea.
@DLosc Oooh, so, each snake's instruction pointer will move through its code in a loop that "terminates" at where the tail goes into the mouth, until the instruction pointer is swallowed?
That's why the second snake of the "Hello world!" program keeps running until the stack is empty.
 
6:36 AM
Right. Though I wouldn't use the word "terminates," since it sounds like "halts" or "exits." The place where the tail goes into the mouth is where control loops back around to the beginning of the line.
 
right
Is each snake on its own line?
 
Yes, lines and snakes have a one-to-one correspondence.
 
gotcha, that makes sense
 
A blank line would be a snake too, though it would die immediately because the initial IP of 0 is >= the length. So in effect a blank line is ignored.
 
6:39 AM
(This discussion probably belongs in the esolangs chat :P)
 
Haha, I thought of that, but no one else is chatting here at the moment...
 
6:57 AM
JavaScript: so powerful, it can stop time.
5
 
7:51 AM
@Dennis says beating 33 is hard to find. Promptly beats it by 7.
 
8:31 AM
@Sp3000 watching the size of the stack instead counting the loops saves 3 bytes in your ><> answer:
"QRBNP"013359v
$0p4}:{:v?=1l<p4+' '{-
g4v?(0:i<+
n~<;
btw nice ><> dictionary!
 
@El'endiaStarman So that's why debugging JavaScript takes forever
 
@randomra I have... no idea why I didn't think of that :P Nice, I'll put it in when I get home :)
 
yeah, it is the common ><> way :)
@Sp3000 just realized, if there would be fold-like functions (sum, product, count), the [] instructions might make a little sense for Gol><>
 
Hmm currently sum/product can be done with R, but not so much count
 
8:45 AM
count is just l in ><>
 
Oh, you mean length of stack. I thought you meant counting how many elements in the stack are equal to the top :P
But yeah coming up with mass manipulation operators is tricky (fold/map/filter) - [] currently secretly move elements to the stack on the left/on the right, but it's undocumented because I'm not sure if that's the best thing to do atm
 
I thought about implementing map in Minkolang by using M[...]. However, I[0g...] would do basically the same thing, and it's only two extra bytes, so...
If filter just drops all zeros, then this should work: I[0gd?x].
It probably would be nice to have that as a built-in. I'll add it after I see a need for it.
 
0
Q: Pascal triangle using ncr function

Cherubim i've trying to generate pascal triangle by making a function to find ncr.... but i've been getting some kind of error... it'd be helpful if someone finds out that for me and help me resolve it //pascal trianglw with ncr function #include <stdio.h> #include <conio.h> int ncr(int i,int j);...

 
That aside, the GUI for the Minkolang online interpreter is a bit yummier now.
5x5 sturdy square neighbors program was still running. I've terminated it. It probably wouldn't have finished any time soon...
 
Yeah map/filter's doable with a for loop (filter's a little clunky though) and fold by checking stack length. The first two only really work by going through the whole stack though, which might not be desired
Oh I can see starred messages on the mobile site
 
9:08 AM
Some people on this site will enjoy this new programming contest
 
@MartinBüttner in the Retina spec. in Txw_dA-Za-Z the second Z is capital too, I guess it is a typo
 
I'm getting concerned that people don't understand the goal of my challenge in the sandbox
Because 3 or 4 times someone has suggested entering their pet esolang which is obviously completely usable
Maybe I'll ban preexisting languages after all.
 
The problem with that is how to ban "tweaks" on preexisting languages.
 
@feersum "Usable" is a sliding scale... Maybe you're making a distinction between "very difficult to use" and "unusable" that I'm not understanding?
 
It should be like Malbolge, not Brainfuck.
In terms of usability.
 
9:18 AM
@MartinBüttner and it should be Tx`w`_da-zA-Z (not Tx`w`_dA-Za-z)
 
@feersum Hm, okay. But the cop still has to write a particular program in it, and hope the robber can't come up with the same program?
 
Not the same program. Any program which completes the required task.
 
Well, yes. But it's the same process: both cop and robber start with a task and have to come up with a program. As opposed, e.g., to the Mystery String challenge, where the cop writes a program and posts the output, but the robber has to start from the output and come up with a program.
I don't know if I'm explaining myself very well, but it seems like the robbers' challenge is strictly easier than the cops' challenge, and thus most or all submissions are likely to be cracked.
The cop has to invent the language and find the program; the robber just has to find the program.
 
The cop can have some tricky idea, and come up with the language and program to exploit it together.
In absolute terms, it's very easy to make an uncrackable solution with cryptographic methods.
Harder to come up with a non-lame solution.
 
@feersum Maybe I'm just having a failure of imagination. Or a failure of thinking like the inventor of Malbolge. :P
I guess I prefer esolangs that require some thinking to use but are, ultimately, understandable (even if it takes an enormously complicated algorithm to do something simple).
 
9:31 AM
I'd prefer non-existing just so that nobody can post Half Broken Car in Heavy Traffic :P (although tbh I don't even know if it's valid for this challenge)
 
I just looked into my submitted sandbox challenges and it seems this one might be worth a try, can anyone give it a quick read and give me some feedback?
4
A: Sandbox for Proposed Challenges

flawrKing of the Sausage This is just a rough idea that I think would be fun, but as I do not have the time to do it right now, feel free to adopt (just let us know in order to avoid collisions.) I believe I saw this 'game' in a tv show once: Two competitors are each given a sausage of equal weight....

 
@feersum Out of curiosity, why is the input in unary?
 
@Sp3000 Presumably to allow substitution-based languages that don't support arithmetic.
 
A language might choose not to have an integer data type.
 
9:47 AM
I was wondering if it'd be better to be able to choose which format, but I guess it doesn't really matter
 
You can always write an adapter for the input that reads a whole integer at once.
 
^ It's your language, who says it can't read integers in unary?
 
10:14 AM
@flawr can you keep record of your previous games against your opponent? otherwise (if there are only 5 rounds) some weak can beat some good players and it could become a kingmaker game
 
10:50 AM
spooky level : git
 
11:26 AM
Aaand that's how computers are made
 
@randomra Thats a good idea.
 
12:05 PM
7
Q: Primes numbers with prime index

bilboWrite a program or function that outputs/returns the first 10000 prime-indexed prime numbers. If we call the nth prime p(n), this list is 3, 5, 11, 17, 31, 41, 59 ... 1366661 because p(p(1)) = p(2) = 3 p(p(2)) = p(3) = 5 p(p(3)) = p(5) = 11 p(p(4)) = p(7) = 17 ... p(p(10000)) = p(104729) = 1...

Accepted an answer that was way longer than quite a few of the others, and accepted it within 16 hours of posting it.
 
12:27 PM
I have a dilemma... Which answer do I accept? cc @Dennis
15
Q: Calculate Standard Deviation

Beta DecayChallenge Given a list of numbers, calculate the population standard deviation of the list. Use the following equation to calculate population standard deviation: Input The input will a list of integers in any format (list, string, etc.). Some examples: 56,54,89,87 67,54,86,67 The number...

 
The Clip one since it was earlier, I believe
 
1:12 PM
0
A: Sandbox for Proposed Challenges

Christian IrwanCreate CHIQRSX9+ Analogue Program. It is meta-golf as well as code-golf. Your task is to create a program in same language, that when given a CHIQRSX9+ will print a that analogue. That analogue program will do similiar thing that CHIQRSX9+ program do. There's exception though. There's may be mor...

 
1:35 PM
@BetaDecay The default tie breaker is posting time, so Clip is the clear winner.
 
2:03 PM
@Dennis Oh, okay thanks. And thanks to you @Sp3000 too
 
2:55 PM
'morning
 
Morning, @Dr.
 
wait how was that a ping?
 
Ghosts of user names past. Mod powers. Magic. Your pick. :P
 
magic
also I just realized that Wander Nauta's challenge has no winning conditions
and didn't want hex after all
 
Who?
 
3:07 PM
47
A: Sandbox for Proposed Challenges

Wander NautaEDIT: This challenge is looking for someone to either writefinish and run an arena server, or someone that wants to rephrase the challenge so that an arena server is not needed and who is also prepared to run entries manually. Both options turned out to be more complicated for me than I originall...

 
Sure it does:
 
I'm trying to finish up this challenge by writing an arena server but I am running into a few difficulties because the spec states no condition from which can be determined the number of rounds
 
> The bot with the largest KD spread, that is, the largest positive difference between the amount of wins and the amount of losses, wins.
 
what are "wins" and "losses" in GOL?
 
> A zero-player game... Until today. You are to write a program that plays the Game of Life - and plays it to win, King of the Hill-style. Your opponent (singular) of course tries to do the same. The winner is either the last bot with any live cells, or the player with the most live cells after 5 minutes of clock time.
 
3:11 PM
ah, didn't see that
slight problem though: timing it sounds like a lot of work
 
3:32 PM
funny how my commit messages are actually meaningful on this project
 
Anonymous
3:43 PM
Hiya
 
Anonymous
@TheDoctor Your GOL KOTH looks interesting, but I think I'm missing something. Are new cells not able to come alive if there's an enemy cell next to them? What happens if both players' cells try to occupy the same square?
 
According to the rules, a new cell will only come alive if there are exactly 3 friendly cells and no enemies
 
Anonymous
Ok, wanted to make sure I was reading that right
 
and the server only lets you set cells to your color if they're empty
 
Anonymous
So if both players try to make a cell alive, nothing happens?
 
3:49 PM
the first will get that cell, and the other one will get a message saying that it was changed
 
14
Q: Programming language where every expression makes sense

user1561358Per recommendation I am reposting this from Stack Overflow. Recently I have been thinking about following issue. Consider a code for a standard "Hello world!" program: main() { printf("Hello World"); } Now almost any change in this code will make it completely useless, in fact almost ev...

We must know some of these
 
@Calvin'sHobbies unix cat
not that it's really programming per se
 
Given a compiler $C$, create a new compiler $C'$ which works as follows: given source $s$, pass it to $C$. If $C$ is happy with it and produces an executable, then that is that, but if $C$ complains then output an executable which prints out You are a bimbo. The compiler $C'$ accepts every string as a valid program. — Andrej Bauer 2 days ago
LOL
I think Foo is such a language. It raises warnings if you try to divide by zero or pop from an empty stack, but I don't think there are actual syntax errors.
 
Anonymous
@Dennis Brainfuck also. The only errors you can get are moving past the end of the tape (if it doesn't wrap, which it should), and unmatched brackets
 
Anonymous
Which are both runtime errors in the spec
 
Anonymous
3:56 PM
@TheDoctor Isn't it turn-based, with both players choosing at the same time?
 
Anonymous
Oh wait the spec says they take turns placing cells
 
Anonymous
Hurr durr
 
the server randomly chooses a player order, and they both get a turn
 
Anonymous
 
Anonymous
 
Anonymous
 
Anonymous
I took way longer than I should have to write my first entry for the coin flipping KOTH because I couldn't remember how to implement an interface in Java
 

« first day (1729 days earlier)      last day (3115 days later) »