The Challenge Anagrams and quines are very popular here on PPCG, so let's combine those two topics into one challenge! Your task here is to write a quine which characters can be rearranged to produce at least one other quine. The more quines you can produce this way the higher your score. Ever...

Biggest single character This challenge is simple, its like the busy-beaver challenges we've had before where the goal is to produce the biggest output one can. But in this one, you can only use one character in your code. You get no input, your code has to be a single character (not byte), and...

We've decided by community consensus that challenges asking for malicious code are off topic. But the question remains: At what point do we consider code to be malicious? Most of the time it's extremely obvious, but sometimes it's more subtle. For example, if code could be used maliciously, even ...

The plus-minus sequence The plus-minus sequence is one that starts with two seeds, a(0) and b(0). Each iteration of this sequence is the addition and subtraction of the previous two members of the sequence. That is, a(N) = a(N-1) + b(N-1) and b(N) = a(N-1) - b(N-1). Objective Produce the plus-m...

@Sandbox: I really like the idea od this challenge, but it has some problems which allow some esolangs to get high scores very easily. A quine in Lenguage for example will always score n!/n. Also reordering of literals allows for some easy scores. Maybe I can circumvent this with a different scor...

Some of you may recall my question about StreamFlow. However, that was closed as unclear, because I didn't explain it well at all. So, I've made a few modifications to the languages specs, and here is the new problem. Language Specifications A program will be a 2-dimensional grid of characters;...