General constraints:
- Your program should not take any input.
- Your program should output words, 1 word/line.
- Only capital letters (A-Z) in the output.
- A word must be atleast 2 letters in length.
- A word can never be a palindrome. That is forbidden.
Rules for word-manipulations, one or more of these operations in any individual order for each new line:
- Change one or more letter(-s) in the word 1 char distance (example: A->B, F->E) from the previous word. 'A' can not be 'Z' and 'Z' can not be 'A'.
- Insert the letter "A" at any position.
- Remove any letter at any position.
Output validation:
Your program must output the following words: OUTPUT, YOUR, SOURCECODE, TODAY atleast (but not limited to) once each, in any order.
Sourcecode validation:
The first and the last letter of all output words should also be part of your sourcecode in the same order as scopes: first and last letter for the first word has the highest scope, example pseudo-code:
<any or no code><first letter, first word>
<any or no code><first letter, second word>
<any or no code><,... ...,><any or no code>
<last letter, second word><any or no code>
<last letter, first word><any or no code>
- For any word # where the actual word number is a fibonacci-number, the first and last letters must be lower-case in the sourcecode.
- For any word # where the actual word number is not a fibonacci-number, the first and last letters must be upper-case in the sourcecode.
There is no restriction of the actual letters in the sourcecode, they can be inside strings or part of a command or anything, it is only the order that counts.
Example valid output (only the words YOUR and TODAY in the example):
YOUR
XOUAS
WOAAT
VOBAU
UOCAV
TODAW
TODAX
TODAY
Example valid sourcecode for the above output:
Since words 1, 2, 3, 5 and 8 in the example output is "fibonacci words", their first and last letter-representation in the sourcecode is lower case, leaving us with this constraint on the sourcecode:
yxwVuTTtyXWvUtsr
There could be any code around or between the letters in the sourcecode as long as the representation is there somewhere in that order.
This is code-golf, smallest sourcecode size in counted bytes wins. Competition ends: 2014-02-31.