3
\$\begingroup\$

This is an answer chaining puzzle, where each answer must add on to the last.

The \$n\$th submission must output its own source code in the \$n\$th language and the \$n−1\$ languages before it.

A language can be either a dialect or a major version of a language, so Python version 2.121 is only counted as version 2 and Common Lisp and Clojure are considered different languages. This excludes compiler flags.

You can post 2 answers in a row, but have to use different languages.

The winner of this puzzle is the person to submit the second-to-last quine if there have been no new quines for a week. The aim of this puzzle is to go on as long as it can, so if you want the green tick, you'll have to respect that.

Have fun.

\$\endgroup\$
4
  • 2
    \$\begingroup\$ But other than that, creative and cool challenge! (Just a note, don't be offended by the downvotes, they are just indicating whether it would be good for the site in it's current form). Also, "output its own source code in n different languages" may seem a little bit too hard for an answer-chaining questions, so you may want to change that to the current language instead of all the previous languages. \$\endgroup\$
    – MilkyWay90
    Mar 15, 2019 at 0:59
  • \$\begingroup\$ Well actually re: scoring, one thing you can do is copy the other polyglot-chaining problem, which has a scoring metric based on both number of languages and code size \$\endgroup\$
    – ASCII-only
    Mar 15, 2019 at 6:25
  • \$\begingroup\$ Let us continue this discussion in chat. \$\endgroup\$ Mar 15, 2019 at 14:15
  • 1
    \$\begingroup\$ Are there any rules on one person posting two answers in a row? \$\endgroup\$
    – Jo King
    Mar 16, 2019 at 7:11

2 Answers 2

6
\$\begingroup\$

><>, 187 bytes

var s=1
<0?"":"var s=1{0}<0?{1}{1}:{1}{3}{1};Write(s,(char)10,(char)34,(char)39,s)//.1+d*fao;!?l{1}var s=1{1}ar*3dr{2}";Write(s,(char)10,(char)34,(char)39,s)//.1+d*fao;!?l"var s=1"ar*3dr'

Try it online!

Try C# Online

Let's add a 2D language, why not?

\$\endgroup\$
6
  • \$\begingroup\$ Just for your info: if you plan to submit again, the quine must only work properly for this lang and another one of your choice, while still including the C# code. \$\endgroup\$ Mar 15, 2019 at 13:42
  • \$\begingroup\$ No. You have to use other people's languages, leave all the previous stuff intact, while adding on your thing. However, the result only needs to work like a quine for whatever lang you choose next and the one in the last submission. If I added something as the third last submission, the quine could work like mud in my language but work perfectly in yours and in the last one. \$\endgroup\$ Mar 15, 2019 at 13:50
  • \$\begingroup\$ I'm reverting it to the polyquine challenge. \$\endgroup\$ Mar 15, 2019 at 14:03
  • \$\begingroup\$ I get 1 What do you want 0/0 to be? What do you want 0/0 to be? when I try running this in Befunge, lol \$\endgroup\$
    – MilkyWay90
    Mar 16, 2019 at 1:01
  • \$\begingroup\$ @MilkyWay90 Yeah, if you're going to add Befunge-98 to this, then you're either going to have to get rid of the "s in the C# code, or have to use nk', e.g. like this quine \$\endgroup\$
    – Jo King
    Mar 16, 2019 at 2:17
4
\$\begingroup\$

C# (Visual C# Interactive Compiler), 63 bytes

var s="var s={0}{1}{0};Write(s,(char)34,s)";Write(s,(char)34,s)

Just to start it off.

Try it online!

\$\endgroup\$
6
  • \$\begingroup\$ I've written a polyglot with ><> (Try it online!), but I can't post it since it breaks the 50+ chars rule :( \$\endgroup\$
    – Jo King
    Mar 15, 2019 at 0:31
  • \$\begingroup\$ @JoKing It also seems to break the no STDERR rule ("something smells fishy...") \$\endgroup\$
    – MilkyWay90
    Mar 15, 2019 at 1:00
  • \$\begingroup\$ @JoKing it isn't impossible, see here. Granted, the two languages are basically the same, but you know, it's the implementation that counts \$\endgroup\$
    – Gymhgy
    Mar 15, 2019 at 2:28
  • 3
    \$\begingroup\$ Okay, but try making a polyquine with a language that isn't C# and see how far you get. (P.S. I've always been annoyed with the implementation vs languages ruling when it comes to polyglots. You wouldn't post a program and say "This is a polyglot with all 16 implementations of the language, because all of them work exactly the same". It's only really a polyglot if none of the languages do the exact same thing with the program) \$\endgroup\$
    – Jo King
    Mar 15, 2019 at 2:46
  • 2
    \$\begingroup\$ An example of a bullshit polyglot is your previous answer here which "scored" infinity, because the "languages" had literally no difference between them \$\endgroup\$
    – Jo King
    Mar 15, 2019 at 2:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.