Let's just see how this goes
If you've ever listened to the radio program "I'm sorry, I haven't a clue", then you've probably heard of the game called "Mornington Crescent". For those who haven't, it's a game where players name random stations on the London Underground network. The first person to name "Mornington Crescent" wins the game.1
In the same sort of spirit as the classic radio game, I present to you Codington Crescent.
The Challenge
The winner of this challenge is the first person to post a working program that prints the exact string Codington Crescent.
The Rules
- Each player has their own program that they will add/change characters. This is termed their running program.
In this way, the only answer-chaining aspect is the rules. Everyone uses their own running program. No one shares a program at all
- Each answer (a turn) has to obey source restrictions defined by previous answers. These are called rules. Each varient lasts for 5 turns. Rules are in the style of either restricted-source, or limiting of language names (but not both).
- Running programs can change languages between turns.
- Answerers (players) can either add or change (but not both) as many characters of their running program per turn as they like. Alternatively, they can choose to "pass", adding no new rules, and still counting as a turn. This may be the only choice if rules conflict with each other. The turn count is still incremented and is to be posted. Pro tip: You probably might want to mark it community wiki because it doesn't add much.
- At the end of each turn, the player declares a new rule that will span the next 5 turns. Rules must be objective, and a TIO verification program is highly recommended. Also, rules have to be able to be applied to every language (e.g.
Programs must not error using Python 3.4.2isn't a valid rule). - Play continues until a running program prints the target string.
Starting Rules
As to kick off the game, the first 5 turns must follow these rules:
- Turns may not print
Codington Crescent. - Running programs must be irreducible. (Clarification, not a rule change: irreducible in this case means that the program doesn't produce the output of the whole program if characters from the whole program are removed. Ie. There does not exist a program that has the default same output that can be constructed by removing characters from the original program.)
- Maximum program length is 20 bytes.
Example Rules
These are purely examples of what you could add as rules to the challenge. They do not apply unless someone decides to use them.
Languages must have at least 3 characters in their name
The first and last letter of the running program must be a space
Running programs must have an even amount of bytes
Languages must be in the practical category on TIO
Running programs must not be more than 30 bytes
Extra Answer Chaining Rules
- You cannot answer twice in a row. Someone else needs to answer before you have another go.
- Languages need to be on Try It Online in order to be valid answers.
1 The original game of Mornington Crescent doesn't really have rules... It's more of an activity that looks like it's a complicated game.
Pro-tip: sort by oldest for a more cohesive flow of answers
Answer Template
# [Language], turn number [your turn]
<code>
[Try it online link]
[prev answer link]
## Rules
- Rule (n turns left)
- Rule (n turns left)
- Rule (n turns left)
```
