Clues, Riddles, and Guesses for Treasure 116

Mohammed wrote (Dec 20, 1996):

> BTW, here is my new self-printing program; a little longer than it
> really had to be in order to avoid making ridiculously long lines.
> I started on this last night but got frustrated and quit.  It uses
> a quote function similar to breadbox's.
>
> -------SP.I-------
> q "\"" =;
> nl "\n" =;
> sm ";" =;
> e "=" =;
> sl "\\" =;
> sp " " =;
> se " =;\n" =;
> q1"qt(q$ <<; << q$ <<; se$ <<; <<; nl$ <<;)=;" =;
> qt(q$ <<; << q$ <<; se$ <<; <<; nl$ <<;)=;
> r1"s1(q sp$ q$ sl$ q$ q$ se$ + + + + + + <<;)=;" =;
> s1(q sp$ q$ sl$ q$ q$ se$ + + + + + + <<;)=;
> r2"s2(nl sp$ q$ sl$ n q$ se$ + + + + + + <<;)=;" =;
> s2(nl sp$ q$ sl$ n q$ se$ + + + + + + <<;)=;
> r3"s3(sm sp$ q$ sm$ q$ se$ + + + + + <<;)=;" =;
> s3(sm sp$ q$ sm$ q$ se$ + + + + + <<;)=;
> r4"s4(e sp$ q$ e$ q$ se$ + + + + + <<;)=;" =;
> s4(e sp$ q$ e$ q$ se$ + + + + + <<;)=;
> r5"s5(sl sp$ q$ sl$ sl$ q$ se$ + + + + + + <<;)=;" =;
> s5(sl sp$ q$ sl$ sl$ q$ se$ + + + + + + <<;)=;
> r6"s6(sp sp$ q$ sp$ q$ se$ + + + + + <<;)=;" =;
> s6(sp sp$ q$ sp$ q$ se$ + + + + + <<;)=;
> r7"s7(se sp$ q$ sp$ e$ sm$ sl$ n q$ se$ + + + + + + + + + <<;)=;" =;
> s7(se sp$ q$ sp$ e$ sm$ sl$ n q$ se$ + + + + + + + + + <<;)=;
> r8"s1. s2. s3. s4. s5. s6. s7. q1<<; q1$ qt." =;
> s1. s2. s3. s4. s5. s6. s7. q1<<; q1$ qt.
> r9"r1<<; r1$ qt. r2<<; r2$ qt. r3<<; r3$ qt. r4<<; r4$ qt. r5<<; r5$ qt." =;
> r1<<; r1$ qt. r2<<; r2$ qt. r3<<; r3$ qt. r4<<; r4$ qt. r5<<; r5$ qt.
> r0"r6<<; r6$ qt. r7<<; r7$ qt. r8<<; r8$ qt. r9<<; r9$ qt. r0<<; r0$ qt." =;
> r6<<; r6$ qt. r7<<; r7$ qt. r8<<; r8$ qt. r9<<; r9$ qt. r0<<; r0$ qt.
> -------SP.I-------

Yow!  This monstrosity is responsible for /dev/joe's finding yet another
Treasure to add to his pile yesterday at about 5:00 pm game time.

Shortly thereafter, /dev/joe sent me a shorter version of the program,
"484 characters on 9 lines, the longest of which is 74 characters".

However, breadbox, using strings with internal line breaks, managed the
following:

---QUINE.I---
a"\""=;b"\\"=;c"\"=;"=;
q( swap. <<a$ <<;<<;a$ <<;a$ <<;<<a$ <<;<<; )=;
a<< $ <<b$ <<;<<;c$ <<;b<<a$ <<;$ << <<;c$ <<;c<<a$ <<;b$ <<;$ << <<;"
q( swap. <<a$ <<;<<;a$ <<;a$ <<;<<a$ <<;<<; )=;
a<< $ <<b$ <<;<<;c$ <<;b<<a$ <<;$ << <<;c$ <<;c<<a$ <<;b$ <<;$ << <<;""q.
"q.
---QUINE.I---

which is only 269 characters on 6 nice, non-long lines.

However, my personal favorite is still the following, which I wrote
during 3 hours when I really should have been doing the last of my
schoolwork or making the bot run.

---harf.i---
barharf
"n harf=;(n$harfharfharfharfharfharfharfharfharfharf!=)(bar n$"=;
fooharf"\n"=;
barharfharf
"+ <<fooharf$ <<;fooharfharf$ <<;$ <<;fooharfharf$ <<;"=;
fooharfharf"\""=;
barharfharfharf
"=;"=;
fooharfharfharf"\\"=;
barharfharfharfharf
"n"=;
fooharfharfharfharf"\""=;
barharfharfharfharfharf
"<<foo n$ +"=;
fooharfharfharfharfharf"\n"=;
barharfharfharfharfharfharf
"<<fooharfharf$ <<;fooharfharfharf$ <<;$fooharf$ ==(n<<;)if. ~(foo n"=;
fooharfharfharfharfharfharf"\n"=;
barharfharfharfharfharfharfharf
"$ + $ <<;)if.;fooharfharf$ <<;<<;n n$harf+ =;)while.n harf=;(n$"=;
fooharfharfharfharfharfharfharf"\n"=;
barharfharfharfharfharfharfharfharf
"harfharfharfharfharfharfharfharfharfharf"=;
fooharfharfharfharfharfharfharfharf"\n"=;
barharfharfharfharfharfharfharfharfharf
"!=)(bar n$ + $ <<;foo n$ + $ <<;n n$harf+ =;)while."=;
fooharfharfharfharfharfharfharfharfharf"\n"=;
n harf=;(n$harfharfharfharfharfharfharfharfharfharf!=)(bar n$
+ <<fooharf$ <<;fooharfharf$ <<;$ <<;fooharfharf$ <<;"=;\n"<<foo n$ +
<<fooharfharf$ <<;fooharfharfharf$ <<;$fooharf$ ==(n<<;)if. ~(foo n
$ + $ <<;)if.;fooharfharf$ <<;<<;n n$harf+ =;)while.n harf=;(n$
harfharfharfharfharfharfharfharfharfharf
!=)(bar n$ + $ <<;foo n$ + $ <<;n n$harf+ =;)while.
---harf.i---