I'm trying to avoid working on the marbelous interpreter right now, so I can clean my house for a party and @NathanMerrill can refactor the the interpreter and add a GUI...
The only downside is that one person might do some exhaustive type of search, and another might find a more elegant way to get the same optimal solution. Not sure if you want to get into that, but then you could just have a time limit, and let people submit test cases
Figuring out the complexity could be difficult for a problem like this. A time limit could work, but how would I accommodate varying hardware? I could run them all on my PC, but then people wouldn't know whether they've busted it until I do.
@KevinL Yes, I've seen it, but I never liked that method. With all the junk going on in the background of modern OSs, it just doesn't seem like a very stable ratio.
Unless you run them both many times ad take an average.
Ok. If I tiebreak by big O, then what do I tiebreak the big O by? It's definitely not inconceivable that two well-scoring programs have the same big O complexity.
also, in most languages you could insert an arbitrary number of the first legal whitespace at the start of your program, so you'd need to make a rule against unnecessary whitespace
> In the case of a tie, the scoring is modified so that the most *compact* maps win. The tiebreak score is the *area* of the bounding box of each map. That is, the length of the longest line times the number of lines.
In the case that submissions tie both of these scoring methods, the tie goes to the earlier entry/edit.
lexicographically order every C program up to length N. number them, 0 through ~100^N. now, you have 100^N possible unary programs, in increasing length
@Sparr Yea, I like this better. If two tie on both those criteria, they're either duplicates or this is way easier to prove optimal than I anticipated.
A - fuse connects to fuses directly left/right of it, while a | fuse connects with those above/below. For example, the fuses || are not connected, and -|are.
"if your map cannot produce a map for a test case, whether it's an impossible case or not, the score for that case is the sum of all times (41 for the example above)."
is sum of all times an easy map for any test case?
Note for Sandbox
I have not finished (or really started) the control program for this game, because I wanted to see if there was interest in it before I dedicated too much time to the project. that means that the rule are still up to be tweaked, so please leave a comment if you have a suggestion...
I know that airport windsocks are calibrated to reach full erection at a particular wind velocity. At half that speed, the first half of the windsock should be erect and the second half should droop sorrowfully. At one third the speed it will be one third, and so on.
Trouble is that not all win...
Just a random idea to blend [king-of-the-hill] & [code-golf]: Have the number of characters in a submission count against it's stealth or something like that. So that there is a balance of adding a more intelligent algorithm and it's character cost.
Anyone can take the idea, just thought it might be cool to see.
In high school we used to drive by the Bank of America office where the illegals hung out waiting to be picked up for work and shout LA MIGRA LA MIGRA and watch them scatter.
I was telling her about Massachusetts and she told us how she wanted to street dance - I asked mom to trade our positions so that I could go to Massachusetts and program all day, and she could do the dancing thing
Richard Stallman, Linus Torvalds, and Donald Knuth engage in a discussion on whose impact on computer science was the greatest.
Stallman: "God told me I have programmed the best editor in the world!"
Torvalds: "Well, God told me that I have programmed the best operating system in the world!"
Knuth: "Wait, wait, I never said that."
A programmer puts two glasses on his bedside table before going to sleep. A full one, in case he gets thirsty, and an empty one, in case he doesn't.
A guy’s at a bar with a 5-drink limit, and he orders Drink #3 for the night. Then he tells the Recursive Bar Joke, except he adds 1 to every number in it. In the version where he orders Drink #6, the bartender says, “You’re cut off.” Guy replies, “But I can have 8 now!”
Frustrated, the professor slams down the phone. His colleague pops his head in to investigate, “What’s the matter?” “Oh, its these damn students. They keep asking for us teach low-level languages.” “So?” “So… if I told them once, I’ve told them a thousand times: There aren’t classes in C!”
Windows 95 is a 32 bit extension for a 16 bit patch to an 8 bit operating system originally coded for a 4 bit microprocessor by a 2 bit company that can't stand 1 bit of competition.
I was just wondering if that worked, because I get pings, but presumably that's because I'm here (I was considering offering him a looping gif and an explanation, doesn't seem suitable as a comment)
if (alive.isEmpty()) { double density = Math.random(); for (int x = -9; x < 10; x++) { for (int y = -9; y < 10; y++) { if (Math.random() < density) alive.add(new Point(x, y)); } } }
If you're happy and you know it, syntax error!
