Our community has found it necessary to create a set of languages designed specifically for golfing, "golfing languages" as we call them. Such languages have evolved from the once brilliant, now clunky GolfScript to the sleek concise languages such as Jelly and Husk. As we can see, these languages are continually getting shorter and shorter for a set of tasks. So, as the obvious experts around here regarding golfing languages, we should design a language together to beat every other language that dares to compete. Introducing Bugle!
Bugle: From the acronym BuGoL: Built Golfing Language.
How this challenge will work
In case you didn't get what I'm alluding to in the introduction, this challenge is an answer-chaining challenge where we each contribute something to the interpreter of a new golfing language, improving its ability to compete on PPCG with each answer.
I will post the first answer consisting of the basis of the language spec/interpreter, and all other answers will continue from that. New submissions will provide the following things:
- A change to the language's spec
- An up-to-date interpreter, meeting exactly what is laid out in the changes
- The language's updated score (more details in a bit)
You may change the spec in one of three ways:
- You may add a single command
- You may add two new commands
- You may edit the behaviour of one existing command
Regarding the new interpreter, you must use the latest version, written in Python. It does not have to be golfed. Every previously added command must be testable with the latest interpreter, as well as the newest command(s) (the one you add). You must also not use offensive language at any point when updating the interpreter, such as in comments or string literals etc.
The added command(s) may do anything you wish. The only requirements are:
- It doesn't produce offensive output
- It isn't the same as another command
- It doesn't prevent one of the sample challenges from being completed
Aside from these, it can be as specific or as general as you want. It can also be any character you want. If you aren't sure if your addition constitutes a 'new command', feel free to ask in the comments.
The language's score
You may have noticed that you have to include the language's score in all new submissions. Its score is what prevents this challenge going forever, and is defined as follows:
The current score is the sum of the byte counts it takes for the language to complete the below 20 tasks
The 20 tasks:
- "Hello, World!" – Output the string
- 1, 2, Fizz, 4, Buzz – Output each integer from 1 to 100 (inclusive) on a separate line, with multiples of 3 being replaced by
Fizz, multiples of 5 being replaced by
Buzzand multiples of both by
- Produce the number 2014 without any numbers in your source code – Output the number 2014 without using any of the characters
0123456789in the source code, without accessing external variables or random seeds
- Obfuscated Hello World – Output the string
Hello, World!, without using any of characters in at least two of the following sets:
Sing Happy Birthday to your favourite programming language – In a language of your choice, output the following:
Happy Birthday to You Happy Birthday to You Happy Birthday Dear [the name of your favourite programming language] Happy Birthday to You
- Output the sign – Given a number, print -1 if it is negative, 0 if it is 0 or 1 if it is positive
- Collatz Conjecture (OEIS A006577) – Starting from an integer, divide it by 2 if it's even, or multiply it by 3 and add 1 if it's odd, and repeat the process until you reach 1. The output should be the number of iterations it takes you to reach 1.
- An Array of Challenges #1: Alternating Arrays – Given an array of integers, check whether all even-indexed items are equal, and all odd-indexed items are equal, and output a truthy or falsy value accordingly
- Am I an insignificant array? – Given an array of integers, check whether the absolute differences between consecutive elements are all smaller than or equal to 1, and output a truthy or falsy value accordingly
- Is this number a prime? – Given a positive integer, write a full program to check whether it is prime, and output a truthy or falsy value accordingly
- I'm a palindrome. Are you? – Given a string, check whether it is palindrome, while your program / function is palindrome too, and output two distinct and consistent values accordingly
- Sum the numbers on standard in - Take a series of numbers in from STDIN and output their sum.
- Find the Factorial - Given an integer
n, output the product of all integers between
- Shortest code to produce infinite output - Without any input, produce infinite output, that will, theoretically, never stop outputting.
- Bake a slice of Pi - Output this exact text:
()()()()()() |\3.1415926| |:\53589793| \::\2384626| \::\433832| \::\79502| \::\8841| \::\971| \::\69| \::\3| \__\|
- Find the smallest number that doesn't divide N - Given a positive integer N, output the smallest positive integer that does not divide N.
- Is this even or odd? - Given an integer N, output its parity as truthy/falsy values.
- Output with the same length as the code - Write the shortest code whose output has the same length as the code, where the output is not the same as the code.
- Golf you a quine for great good! - Write the shortest quine in your language.
In order to be valid, a new submission must have golfed submissions for at least 2 of the problems, by at least 1 byte for each. You may increase the lengths of other submissions, but the total score must decrease by at least 2 per answer. Also, please consider including a link to the updated programs. The updated solutions must not work when run with a previous version of the interpreter.
How to get cookies
I have a list of 5 challenges, which aren't compulsory to attempt, and have no bearing on your score, but are simply additional challenges to test if Bugle is capable enough. Feel free to include a solution to any number of these in your answer:
- Create a Self interpreter
- Create a payload capable quine
- Covfefify a string
- Hyperprogramming: N+N, N×N, N^N all in one
- "KNOT" or "NOT"?
Descriptions not included as they aren't required for everyone to be able to compete in the challenge.
How to win
Once the minimum score (we believe to be 16, although any attempts to golf that down are much welcomed) has been reached, obviously the chain has ended as solutions cannot get a better score. Once 16 has been reached, the challenge stays alive for 1 month afterwards, to give anyone a chance to golf the solutions any more. After this month has passed, the challenge is over.
Once the challenge is over, I will be migrating the interpreter onto a GitHub repository, and going through the usual machinations of releasing a stable language. You may also begin to post solutions to challenges on PPCG at this time, using the said language, but please try not to flood the front page with answers. Instead, spread them out over a period of time.
In order to make information easier to find in your answer, please format it as follows:
# [N]. [Score] [New command + description] [Interpreter/link to interpreter] [Link to programs]
[N] is your answer number (1 for the first, 2 for the second etc.)
- You must wait 3 hours between posting answers
- You may not post twice in a row, unless no answer has been posted for 10 days (exactly 240 hours)
- You may not remove previous commands.
- Your interpreter doesn't have to be golfed, and its byte count is completely irrelevant here.
- If someone suggests a golf to the programs while your answer is the latest, you must edit in the golfs, and update your score.
- You may also do this when your answer is in the middle of the chain, so long as your score doesn't become lower than any later answers.
- Please refrain from answering any existing PPCG challenges using this language, at least until the challenge is over
- The interpreter is written in Python 3, and should continue that way throughout the entire chain. Changing the language is forbidden.
- Again, in order to be valid, a new submission must have golfed submissions for at least 2 of the problems, by at least 1 byte for each.
Let's get started!