Yeah I thought so too. I was honestly surprised when I saw that he submitted an answer for such a minor golf... But of course that's up to him to decide, because it was a rather clever-ish golf (even though the outcome was just -1).
Although, @NieDzejkob if you can (don't feel obligated to), could you try to add a way to sort the cracked answers by the person who cracked it? It would make it much easier to see which Robber wins.
Minimally sort a list into a matrix
code-golf array-manipulation matrix
Given an unsorted list of unique strictly positive integers, minimally sort it into a 2D matrix. The matrix is not necessarily square, but the input is guaranteed to form a non-jagged matrix. Minimize the dimensions of the ...
But yea, writing golf'd assembly for the R16K1S60 has been fun. Dunno if i'll do more, but the R16K1S60 is really intresting to golf for. Very flexible, even if it only has 1024 bytes of RAM total
Context
Consider square matrices with n columns and rows containing the first n^2 (i.e. n squared) positive integers, where n is odd. The elements of the matrices are arranged such that the integers 1 through n^2 are placed sequentially in a counterclockwise spiral starting at the center and ini...
Your task is to write a computer program such that when it is cut up into lines every arrangement of lines will output a different number between 1 and n! (where n is the total number of lines).
For example the python program
print 1;"""
print 2;"""
Has two arrangements
print 1;"""
print 2;"...
@cairdcoinheringaahing on a language-specific or language-unrelated challenge if someone achieves the best score possible, then yes, otherwise (with other exceptions) no.
Nowadays, I would use the accept feature iff: my challenge is a KOTH, my question is a "Help me golf this as much as possible" tips question or if my challenge is a CnR (Robbers' Thread)
Speaking of overthrowing accepted answers--I just golfed 47 bytes off my Brain-Flak Classic interpreter by switching approaches. Take that, APL! (CC: @DJMcMayhem)
If you really didn't want to lose rep from downvotes, you could delete any answer that got downvoted and have a massive storage of challenges to accept answers for
@AdmBorkBork From time to time, I get a random downvote. Looks like my Proton answers are extremely prone to being downvoted, for some reason. I guess someone hates Proton :P
well, continuous golfing language development means that things evolve over time, for example back in 2007 GolfScript was released and it was probably the golfiest language ever
now, more than 10 years after that, golfing languages have evolved, and will continue to evolve, since they want to beat each other in average performance
you won't have much of a chance to compete in GolfScript anymore
in front of gs2, Pyth, Jelly, 05AB1E, Charcoal, etc. GolfScript is like Java compared to other mainstream langauges
@EriktheOutgolfer For some tasks. GolfScript had a freakishly small amount of built-ins, so it didn't stand a chance against J and APL in some challenges.
It's been literally a year, I'm not sure anymore. But it had something to do with connecting together a large grid of two types of resisters so that the overall resistance of the grid approaches some particular function.
Minimally sort a list into a matrix
code-golf array-manipulation matrix
Given an unsorted list of unique strictly positive integers, minimally sort it into a 2D matrix. The matrix is not necessarily square, but the input is guaranteed to form a non-jagged matrix. Minimize the dimensions of the ...
Your task is to write a computer program such that when it is cut up into lines every arrangement of lines will output a different number between 1 and n! (where n is the total number of lines).
For example the python program
print 1;"""
print 2;"""
Has two arrangements
print 1;"""
print 2;"...
