I wanted to fool a friend by giving him a quine that almost worked, but became sloppier and sloppier.
Create a program that, when run, will output the program, but one character off. Either one character can be added, removed or both (one character changes). But only one character.
Your score will be
(length of your program) / floor(sqrt(number of times the program almost quines)) (Where
/ 0 is infinity)
number of times the program almost quines is how many times your program runs while only changing one character in stdout. Your program may not accept input. It may also not print a program it has already printed.
You may also not add a character that you have previously added before, or remove a character from the same index. For example, if you have added
1 before, and you add
1 again, that's where the
number of times the program almost quines stops. If you remove the first character, you may not remove the first character again. If you changed the third character into a
2, you may not add a
2 or remove the third character.