Generate a sequence of uninteresting numbers
The OEIS Foundation's On-line Encyclopedia of Integer Sequences is well known around these parts for it's fascinating descriptions of interesting sequences of numbers.
But what if you want to generate a sequence of uninteresting numbers? The OEIS is...
By my definition, to match entropy would be to build a superintelligence that knows the exact distribution of billions of possible code-golf challenges people pick from when posting to PPCG, and Huffman code from that distribution so no solution would be more than ~10 bytes long
I personally love quines, but they all seem to be so... static. So why not create a quine that can do more.
Challenge
Create a quine that, depending on its input, generates another quine (either a different language or something of the sort)!
Requirements
No examining source code directly.
Ta...
@lirtosiast because If the is not a reason for competitive being important excluding the rules, then the reason must be including the rules — tuskiomi23 mins ago
um can someone explain to me what OP is saying here?
@Veskah If they claim that as a separate language, it would be cheaty. Score in C# should have the byte count difference between calling with option and calling without added to code size.
@BMO ok. imo collapsing repeated steps (under -d2) and displaying universe after every step would be useful debug tools in Alchemist
@lirtosiast @Veskah Uh no, check consensus (well, I haven't actually read it. either they say something about options like this (and C's define options etc.) and I'm wrong, or that needs to be added to the relevant meta question)
@ASCII-only You're right, I haven't read the consensus in a long while. The consensus mentions C where flags are required to specify, but I'm not sure how we're supposed to deal with flags like these (that seem to import automatically?)
@ASCII-only even with more optimisation, I don't think the Alchemist quine would run in anywhere near reasonable time. for every character, it's trickling an extremely large number through a three step binary process and then back again, one atom at a time
i did have an extra rule in testing that converted 8 of the basic atoms to the final atoms to make it like 20x faster
hmm. in my prime checker I saved a byte by removing a restriction, which ended up having the consequence that, as two rules were resetting the counters, another rule was undoing that work at the same time
Working with some DBAs, troubleshooting slow responsiveness in a particular application. The DBAs discover a portion of code that is JOIN-ing 24 tables together and then SORT BY 46 different fields. It'll be interesting to see what the app vendor has to say about that.
Yeah lol I just had to do some maintenance the other day on some old DB functions here in my company. We found one that took like 50s to do an operation which shouldn't take more than .5
Playing Pickomino code-golf game
In the game Pickomino, there are several tiles lying in the middle of the table, each with a different positive integer on them. Each turn, the players roll dices in a certain way and get a score, which is a nonnegative integer.
Now the player takes the tile wit...
I actually think it's an awesome idea, it's just that The output cannot just be a copy or an altered copy of the original, no appending or deleting characters of the old quine into the new quines kinda makes it subjective
Isn't every string just some other string with all of the old characters deleted and a bunch of new ones appended?
Setting that aside, This V program technically meets all of the requirements, and has a score of infinity.
Up to 500 rep for beating me at Write a Quine Suite
I will give a bounty to anyone who can beat me at this challenge. For the record, the scoring on that challenge is:
Most quines wins. Shortest sum of quine lengths is a tie-breaker.
Currently, I hold the record on that challenge with a sc...
Find the needle in the haystack
code-golf string
Given a rectangular haystack composed of all the same printable ASCII characters, output the location (counting from the top-left) of the needle which is a different character.
For example, if the following haystack is input:
#####
###N#
#####
...
Wilderabeest with moves of 1,2 + 1,3 + 1,4: Reached position 1736708854818 (pruned to 1556319310032; max previously visited: 1736703583468); this exceeds allocated array
I remember how unimaginable it was when I heard of some supercomputer having gigabytes of RAM. I think at the time I didn't even have a gigabyte hard drive.
I'm old enough that I had a "keyboarding" class. I hated it, too, because it was graded on % improvement, but I went into the class typing 80 wpm, so I didn't have much improvement. :-/
The Great Pyramid of Quine
The task is a rather simple quine challenge with a twist, you must output your source code in the shape of a pyramid. The shape of a pyramid is defined below:
1
234
56789
ABCDEFG
HIJKLMNOP
QRSTUVWXYZa
bcdefghijklmn
......etc......
The mai...
@Dennis I'm not disputing whether the answer is valid for OP's phrasing of the question, I'm just curious about the cost of handling zero vs. not handling it. There's unlikely ever to be a second Factorial question in which zero needs to be handled, and it's a rather fundamental problem, so I think it's worth noting in each answer if zero is handled and how it would be best handled.
And I think it's not very interesting to just treat it as an OP's-word-is-law issue where the only thing worth doing is responding to the exact wording of the question. So I'd like to see that 6 byte version please. :) (Saying this here instead of in the answer's comments so as not to turn it into something that's liable to be moved to chat.)
@EriktheOutgolfer the 2x1 or 1x2 question is a good one. Since it's ambiguous, maybe I should guarantee the haystack is at least 2x2? That removes the edge case of "only the needle" as well.
Yeah, now that I think about it more, I think I will guarantee it's 2x2 or larger.
@AdmBorkBork in reality, you only need to guarantee it's not 1x2 or 2x1 if you want to go like that (well, you can't just assume what the needle is and bring a haystack and whoops, can you? :P)
@Neil Clearly, the people dealing with this have no idea what they are dealing with. They refused to the request for information on the algorithm when 1) it was actually publicly available, 2) it has no security impact as it is just a check digit to avoid typos.
"In just a few CPU instructions, the truncated base 2 logarithm of any integer can be computed for any integer from -2^63 … 2^63 – 1. This has interesting applications in being able to rapidly access logarithmically increasing arrays. The Linux GCC compiler provides a built in function, __builtin_clzll, to allow this CPU instruction to be used directly from C and C++ on a 64 bit integer.
@Veskah My experience with Selenium was mixed. It was certainly very neat and reasonably easy to learn, but often the interactions were not quite precise enough so I'd have to build in multiple tries and/or offsets, and worst of all, Chrome's side of things tended to change from version to version, requiring adjustments of my code too often. It may of course have settled in the last couple of years.
@wizzwizz4 that's ok. I might ping you tomorrow. Running into some interesting behavior with http1.0 vs http1.1 and keeping connections alive through chunked responses, etc
Generate a sequence of uninteresting numbers
The OEIS Foundation's On-line Encyclopedia of Integer Sequences is well known around these parts for it's fascinating descriptions of interesting sequences of numbers.
But what if you want to generate a sequence of uninteresting numbers? The OEIS is...
I personally love quines, but they all seem to be so... static. So why not create a quine that can do more.
Challenge
Create a quine that, depending on its input, generates another quine (either a different language or something of the sort)!
Requirements
No examining source code directly.
Ta...
Playing Pickomino code-golf game
In the game Pickomino, there are several tiles lying in the middle of the table, each with a different positive integer on them. Each turn, the players roll dices in a certain way and get a score, which is a nonnegative integer.
Now the player takes the tile wit...
Up to 500 rep for beating me at Write a Quine Suite
I will give a bounty to anyone who can beat me at this challenge. For the record, the scoring on that challenge is:
Most quines wins. Shortest sum of quine lengths is a tie-breaker.
Currently, I hold the record on that challenge with a sc...
Find the needle in the haystack
code-golf string
Given a rectangular haystack composed of all the same printable ASCII characters, output the location (counting from the top-left) of the needle which is a different character.
For example, if the following haystack is input:
#####
###N#
#####
...
The Great Pyramid of Quine
The task is a rather simple quine challenge with a twist, you must output your source code in the shape of a pyramid. The shape of a pyramid is defined below:
1
234
56789
ABCDEFG
HIJKLMNOP
QRSTUVWXYZa
bcdefghijklmn
......etc......
The mai...
