well, this finally explains why i've never understood like half the quicks
TBH until recently i didn't realize most of the loop quicks varied the right argument per iteration until i looked through the source code / you mentioned the fibonacci behavior
aight, added all the quicks to the data table too :D now i just need a few syntax components and i should be done the boring part
given how easily I give up on things, I'm surprised I managed to enter nearly 4000 lines of JSON by hand (a good amount of lines just containing { or } tho)
Compile Esolang to Esolang
Based on Convert FRACTRAN to Brainfuck.
Compile Brainfuck to FRACTRAN
Compile /// to Brainfuck
Compile Brainfuck to ///
If you have other ideas, please add them. Be sure it's reasonably doable with simple tarpits, eg Jelly to Vyxal to APL isn't all that fun. If you ca...
I have tried to solve this problem but cant seem to figure it out please help. the program using an already given array and one user input array and for the third array the program takes the user input and inserts that into the power formula the result is displayed all in ascending order in table...
> Size: The optimal size for creating a favicon is 16x16 pixels, which is the size in which they are most commonly displayed. However, they can sometimes appear in larger dimensions too (such as 32x32 pixels). If you need help getting the right size for your image, try using Wix's Image Resizer tool.
@AviFS a friend of mine's kids (this is an older friend obviously - think older than Dennis) went out bike riding. They had to take a walkie talkie with them for communication (the kid is around 10ish), so I got a hold of the walkie talkie on the end here and epicly pranked them.
2
However I suspect my efforts may have been wasted due to the victim not understanding what a rickroll is
hmm. not sure - on one hand, (other than the fact that i ripped off most of jelly's structure and just extended a crap ton of features for yuno) this is unique, but on the other hand, it isn't that representative at face value
@hyper-neutrino Were you specifically objecting to me saying it reminded me of a Mesopatamian or East-Asian script? Or just that you don't have the same general feel?
@hyper-neutrino Haha, thanks. Glad you like it! Was totally out of left-field, tbh
I hit Hello World on TIO to get a sample program that I could base it off
And, of course, the quotation marks were the only interesting feature of such a simple program
Dilemma: I'm trying to create a language that truly minimises redundancy by making it basically impossible to create two programs that do the same thing. However, I strongly suspect this will take all the fun out of golfing if there is truly only one way to do something because it will be impossible to ever improve a program
Background
This is a follow up question to the question: Will the Hydra finally die?
As before a dangerous A Medusa have released a dangerous Hydra which is revived unless the exact number of heads it have is removed. The knights can remove a certain number of heads with each type of attack, and ...
@pxeger i've had that idea too and it's definitely interesting to think about
i think strictly speaking it's impossible because if you have code that solves a problem in one domain it also solves it in a smaller domain but it would also be solved in that smaller domain by something which perhaps even hardcodes different behavior outside that domain
and there's probably some other problems if you sidestep that consideration
@pxeger ngl, this sounds kinda similar to an "inverse Stack Cats", in that in Stack Cats, every builtin tries to undo itself, but in this, no builtin can undo any other builtin
except this is more a case where you have builtins that can undo each other but it's impossible to use them to do so
i'm assuming the encoding scheme is akin to some kind of contextual frequency compression where the probability so to speak of redundant behavior is defined as 0
This challenge was inspired by this tweet.
Idea
Consider a circle with n evenly spaced dots around the perimeter, where each dot has a postive integer value:
Now connect the dots with non-intersecting chords:
Next consider our score, which is the sum of the products of these pairs. When n is o...
@hyper-neutrino Are you considering extending your integer / list compressor to include the builtin constants (e.g. it says the shortest way to represent 1,2 is 1,2 but ؽ works)?
@cairdcoinheringaahing eventually, I intend to make it also be able to determine ways to use grade/group, base conversion, etc, but that's a project for the long term
but yes, built-in constants is an earlier step
the main reason I am restricting to literals is a) easy to implement and b) the user can tack on other literal components easily, but that latter part isn't all that necessary if the user just uses a couple of ¤s
also, i might try to merge my integer and string compressor to just make a "constant compression tool" but it'll be a large project if i want to make it even close to fully optimal
@NewPosts i feel like there's some approach with like get all partitions for each rotation and recursively apply until you've broken it down but that also feels a) slow and b) long and i'm sure there's a more elegant way to do it so i will hold off on my fgitw attempt
but i don't think i'll go so far as like group/grade, except maybe some basic things like if it detects the list is a permutation or a grouping of indices, then show the ungraded form / permutation order and tell the user to look for a smarter approach there
i could even add like an index where verified people can add a constant / constant category they find based on some pattern, but idk how well that'd work
i'll look through the atoms and try to find a list of things that are common enough and not insanely hard to reverse-engineer optimally
Challenge
Given a graph (a structure consisting of nodes and vertices), classify it according to a few categories.
Specifically, you will be given an unweighted directed graph, which is a set of nodes and edges from one node to another (but not necessarily both ways). You can take this in any rea...
output is not binary but the tag just says "For challenges which involve deciding whether or not the input meets certain criteria, and outputting some data, representing that decision.", and this has multiple decisions with the output based on those
> In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph
@hyper-neutrino Oh wait, it's missing the connected part
@xnor Regarding my previous comment about OEIS submission: I just found out I can create the entry with my formula, and then you can edit it to add yours. So it will be automatically attributed to you. Do you have an OEIS account?
("found out" meaning @flawr told me it can be done)
TNB has spoken - 10 tabs and 2.484 spaces are the best (I'm discounting HN's 58,572 votes for "No indentation whatsoever" because they ruined the beautiful 6969 votes for 1 space :/)
Compile Esolang to Esolang
Based on Convert FRACTRAN to Brainfuck.
Compile Brainfuck to FRACTRAN
Compile /// to Brainfuck
Compile Brainfuck to ///
If you have other ideas, please add them. Be sure it's reasonably doable with simple tarpits, eg Jelly to Vyxal to APL isn't all that fun. If you ca...
This challenge was inspired by this tweet.
Idea
Consider a circle with n evenly spaced dots around the perimeter, where each dot has a postive integer value:
Now connect the dots with non-intersecting chords:
Next consider our score, which is the sum of the products of these pairs. When n is o...
