Mini Quine

[teebee]

Here is my quine of length 80:

Code: Select all

554117123192637267319262416362179119179117319262324204
369*^0^p0^6?+69*c
7?9*1^+P$

Actually, at first I thought that I had to add a useless instruction ("@") to get the quine work. So, my quine of length 81 which solved the "Mighty Quine" challenge was:

Code: Select all

451451137329162836237916242616312199711971137916232120
369*^0^0^p6?+69*c
8?9*3^+P$@

[teebee]

Here is another quine of length 80 that uses the coding scheme (4+x)*9-(4+y) instead of (3+x)*9+(3+y):

Code: Select all

665217128223544358822353725453172219172217822353737304
469*^0^p0^6?+69*c
7?9*1^-P$

[tails]

Hi, sorry to be late :-)

Code: Select all

155411712319263726731926241191791639217911731926232910
369*^0^9?0^p+69*c
7?9*1^+P$

[Yharaskrik]

Hi tails,
this is exactly my code...

[teebee]

Nice to see you again, tails! Your approach is somewhat cleaner because all of the data instructions are handled similarily. Nevertheless, my approach does it in less than 1200 cycles.

[teebee]

This quine uses the coding scheme (5+x)*9-(5+y):

Code: Select all

554197927112433247711242614342971199971197711242526204
569*^0^p0^6?+69*c
7?9*1^-P$

[Hippo]

And here is mine:

Code: Select all

15958288756379398445228875738568791938893889328875717
0
269*^0^0^p9?+69*c
P1^4?9*-$

using codding scheme (2+x)-9*(2+y) (mod 0x80)

The starting padding digit could be arbitrary nonzero, the 30 on the stack at the end of first cycle is double dropped by ?.

It seems to me it cannot be shortened more ... 69* starting address is limiting, the 77* does not generate enough to encode 26 instructions, except we would be extremally lucky in bounding conditions ...

but I have not solved the mouses yet ...

[Hippo]

Here is my quine of length 80:

Code: Select all

554117123192637267319262416362179119179117319262324204
369*^0^p0^6?+69*c
7?9*1^+P$

Actually, at first I thought that I had to add a useless instruction ("@") to get the quine work. So, my quine of length 81 which solved the "Mighty Quine" challenge was:

Code: Select all

451451137329162836237916242616312199711971137916232120
369*^0^0^p6?+69*c
8?9*3^+P$@

Wow, both codes are interesting ... you have padded after 0 in the first (actually it is not pad, but way to use the 0) ... I have padded with useles digit on start.

You have not codded by consecutive pairs of digits in 2nd so for the half of the last char there is no shift applied to all other digits ... what allows codding $ by 9(3+x)+(3+y) schema.

[Hippo]

Hi, sorry to be late

Code: Select all

155411712319263726731926241191791639217911731926232910
369*^0^9?0^p+69*c
7?9*1^+P$

Oh nice encodding of the last $ but the padding was difficult here ...