Message board for the users of flat assembler.
> Heap > Esoteric Programming Challenges!
Goto page 1, 2, 3 ... 10, 11, 12 Next
Three esoteric languages have been used in competitions thus far, being Befunge, Brainfuck and Challenger. I'm keeping a record in this post of the challenges, and the smallest solutions in each esoteric language. If you would like to use another esoteric language, just post your solution and I will add it to the solutions for that challenge. Please state which challenge you are writing code for as I will probably not have time to test every solution in every language posted to see the output.
As the Challenger language does not have output instructions, output can be anywhere in the challenger space, as long as the output is true to the challenge description. Both Pure Challenger and Framed Challenger will be considered separate languages for the purpose of these challenges.
And links to FASM interpreters for these languages:
Note that if the chosen language permits it, the solutions use \n as the line endings to reduce the script size.
If you have a good idea for a challenge, post it and i will add it to this post if i think it's worthy.
Challenge 1 by Pinecone_:
Produce the following output:
Newline after lowercase alphabet required, and after printing the user is to press any key before the script ends.
Smallest befunge solution so far: 38 bytes by Pinecone_
"A4"v >91+,"@~a"10p92+0p \-2<_^#