I reckon. Nobody's complained yet, and it's nice to have the discussion out where it can get publicity, but it probably warrants its own room at this point.
The thing I like with Clojure is its ->> thing, which chains together a bunch of functions together, so there's not an overload of parens at the end of a function.
@WheatWizard I think you misunderstood the challenge a bit, you should have written one program, which when run in brainfuck generates a brain-flak quine, and which when run in brain-flak generates a brainfuck quine.
@Riker It's a meta-game about games and game-narrative and the choices you make in games. It's a little goofy, and fairly short, but it's really good and original. I highly recommend it
Here's a quote: "Stanley entered the room, and saw two doors. Stanley took the door on the left." *Takes right door* "That was not the correct way, and Stanley knew it perfectly well"
No Title Yet
answer-chaining
Create an interpreter for the previous submissions! The interpreter could take a string, an array of characters, etc.
The first answer must print the integers from 1 to 10.
What? What if the previous answer is in Mathematica?
You only need to implement the functi...
@Riker I really don't want to say anything more about DRTTaTTCEaWH because spoilers, but I will tell you it's about an epic cursed jewel heist in Europe, and this genius doctor trying to stop it, and there's a tiger in several points and ... OK, I'm done. This is stupid, I'm calling OSHA, I can't work under these conditions! Get someone else to describe the game for you
A generational algorithm to find all solutions
The Idea
In every string the last character can only contribute to a limited number of runs.
A last 0 can only add a run to
10 + 0 => 100
since in
00 + 0 => 000
it's only a repetition. Anf if it adds that minimal run, the next possible minim...
the problem with this challenge was that it is all integer based. This meant a few problems a) It became a big int challenge, b) it allowed optimizations which were only relevant to the specific sort of input I specified c) this meant that the interesting part of the parallelization didn't occur
what I should have asked was the same challenge with complex numbers because
a) you now have to worry about vectorizing complex number arithmetic b) you have to think about using Gray codes to speed things up c) using Gray codes makes it more interesting to parallelize
@orlp yes.. well in fact you would choose a "random unitary matrix" as the input. I would provide the code to do that
this means the absolute value of the permanent is less than 1