Your goal, is to write a set of programs, that progresses from one to the other, one character at a time. For example. Given the starting program
abcd and the ending program
wxyz, you should have 5 valid programs, with the respective outputs.
abcd -> wbcd wbcd -> wxcd wxcd -> wxyd wxyd -> wxyz wxyz -> wxyz
As can be seen, the last program should be a quine.
- Your start and end program may be any length, And they may also be different lengths
- Your start and end program must contain entirely unique characters at each position, but may share characters overall.
- Each program should affect a single character at a time, in any order, characters should only be added or removed from the end of the program.
- None of your programs need to follow the valid quine rules, they only need to output the correct string.
- Standard Loopholes Apply.
Programs are scored by the length of the start program plus the length of the end program in bytes. In the previous example,
4 + 4 = 8, so the score is eight. This is code-golf, so shortest programs wins.
Some Valid Programs
In languages that hopefully don't exist
abcd -> dbcd -> dccd -> dcbd -> dcba a -> b a -> b -> bc -> bcd -> bcde ab -> aa -> ba [BLANK PROGRAM] -> a xyz -> xy -> x -> [BLANK PROGRAM]