Write a quine that consists of real English words separated by single spaces. A "word" is defined as a string containing only lowercase and uppercase letters (
/[a-zA-Z]+/ in regex). To be "real" your word must be recognized by the official Scrabble dictionary.
I'm using the Scrabble dictionary since it gives a definitive answer on what is and isn't valid. There are too many gray areas with a normal dictionary. Note that "A" and "I" (not to mention "quine") are not valid scrabble words.
Since writing a quine only using letters and spaces is close to impossible in most programming languages, you have the option to replace the single spaces between words with a character of your choice. You also have the option to append characters to the front of the first word and the end of the last word. These added characters may be anything (including newlines and non-ASCII) except letters (a-z, A-Z). There is a penalty for adding them though (see Scoring.)
- As usual, the quines may not read or access their own source code. (I'd say that HQ9+'s Q command violates this.)
- Output should go to stdout or a similar alternative. There is no input.
- The words do not need to be capitalized correctly. They can have caps and lowercase anywhere. The sequence of words does not need to make any sense.
- No word may be used more than 3 times in your program. Differently capitalized words are still the same word (e.g. 'DOG', 'dog', and 'dOg' are all the same word).
- Using languages like PHP or HTML that can just cat out their contents is considered a trivial loophole and is not allowed.
- The program must contain at least one word.
Your score is the number of "real words" in your program plus these penalties:
- +1 for every space that was replaced with another character
- nn for every n characters you added before the first word (yes, that's n to the power n)
- nn for every n characters you added after the last word
For example, the program
We all LIKE PROgraMmING
would score 4 because it contains 4 words; no characters were added or replaced any spaces. It's output would of course be
We all LIKE PROgraMmING.
!We@all LIKE#PROgraMmING- =
would score 4 + 2 + 1 + 27 = 34; 4 for the words, 2 for the replaced spaces, 1 for the
! at the front, and 27 for the
- = at the end. It's output would of course be
!We@all LIKE#PROgraMmING- =.
The lowest score wins. Tiebreaker goes to the answer with the fewest penalty points. If there's still a tie the highest voted answer wins.