The really powerful builtins would be encoded in about 2 to 2.5 bytes each, and with the builtin loophole at +45/-40 they would count for the forseeable future.
Add that to a stack-based core that isn't limited to printable ASCII, with some useful basic math commands like TI-BASIC's in 6 to 10 bits, and I don't see anything it couldn't win at.
Regarding the reddit thing (you probably aren't interested), the company fired an admin that the mods really liked. Now the mods are literally shutting down portions of the website in protest.
@Doorknob Apparently there was some employee which was responsible for organizing/conducting all of the celebrity interviews that reddit likes to host.
Such as a lot of the high-profile IAmA stuff
And she got let go for some undisclosed reason.
To which the mod's response was along the lines of "This is your biggest traffic magnet, and you can't seriously expect us to do this by ourselves as volunteers" and so they shut it down.
I think I have 40 bytes. If I change int(9irand to int(i10^(rand to prevent the amulet from spawning at 0, I can move the iPart( from the calculating code to the printing code and not suffer from rounding errors...
but then I still need to worry about rounding errors affecting the boundary check.
I think my best option is just to write a new boundary check.
I got the important bits of my minimal Nethack down to a single line.
Let's see if it works, and if it's shorter.
It's shorter by two bytes...
And it seems to work...
Okay, it works!
39 bytes!
Wait a minute... maybe not
Okay, 39 works, I just need log(getKey-3 instead of log(getKey-1
That suspense when you look at Dennis' 40-byte solution, see "an edit has been made to this post; click to load", and click on it to see if it's been further golfed
Am I offering a bite that's more than people are willing to chew?
Truth Table Solver
Goal
This code golf challenge is to display a rule that is valid for a given truth table.
Input
The input into the program is a boolean array, though you may choose how this is formatted (array, string, et...
Wireworld is fun for the whole family! Your goal is to create a Wireworld implementation in the shortest amount of code possible.
A Wireworld cell can be in one of four different states, usually numbered 0–3 in software, modeled by colors in the examples here:
Empty (Black)
Electron head (Bl...
In TI-89 basic booleans aren't 1 or 0 so you can't add conditions to numbers.
You also can't leave off closing parentheses or quotes.
Also, fewer commands are one byte long.
Another thing: There is no Ans variable, only an ans(howmanylinesagoyouwanttheresultfrom) command.
So you need to store everything into a variable.
Wait, some of those may be wrong. I just looked it up and tokenization for the 89 stores everything in postfix notation, so parens and commas aren't stored.
TI-89 BASIC may actually be decent for golfing, although I don't have a TI-89 to test with.
I've just closed Shortest Wireworld as a duplicate of Simulate the Wireworld cellular automaton. However, this is one of those lose-lose situations:
Leave the new question open: answers to two essentially identical questions are split between them, or answers to the older one are reposted.
Clos...
There are a lot of questions out there with ascii art but i was thinkink if a question requesting animated ascii is accaptable? Problem is i dont think many golf languages support some sort of clear/redraw command for their output, so the users would be forced to use other languages.
That being ...
that's too bad. i wrote something at work that i'm not really happy with, and i would like someone to look at it, but i also don't want to make it public. i guess i could obfuscate it
i basically ended up with a digraph class that knows too much and does too much
After spending a while on Stack Exchange, I can recognise most sites in the Hot Network Questions by their little icon (which is also their favicon), but certainly not all of them. Let's write a program which can! You're to write code which determines the site, given one of the (currently) 132 fa...
I check each answer against the Stack Snippet before adding it to the leaderboard but there's no obligation to include the image in your answer (it's completely optional)
@Sp3000 I've added you to the leaderboard now (But Will has an improved answer and is only one pixel behind you now...)
Since all the primitive Pythagorean triples (and therefore most of the total triples) are odd^2 + even^2, it seems like there would be fewer possible distances for odd^2+even^2.
With a couple changes I could. Though...I'm out of town right now and just letting it run in the background. I may just restart it anyway. It's a long weekend :D
> The logo is inspired by Tree of Life. Its branches subtly form the Star of David. The main branch and the "o" in "Yodeya" make up a question mark to reflect the Q&A nature of our site. The tittle in "Mi" is a falling leaf, which further bonds the logo mark and the logo type. The Hebrew letters of Mi Yodeya are embedded in the tree as hanging fruits.
Recursive Description
Recently, I made my very first contribution to OEIS by extending and adding a b-file to sequence A049064. The sequence starts with 0, and then the next values are derived from giving a "binary description" of the last item.
For example, the second term would be 10, becaus...
Wow I tried to add a weighting which prioritises longer distances, and while it does better initially it degraded really fast towards the end giving a final of 124
@PhiNotPi "Staring at blank screens is not fun. The program must visually display the simulation as it is running." If the representation is in ASCII, can it be any four characters? Even something like 0123? Also it would be nice if you explicitly mentioned somewhere that the program should run in an infinite loop. (As opposed to computing a fixed or given number of generations.)
@Dennis can't you use a single s at the beginning of the loop?
Am I offering a bite that's more than people are willing to chew?
Truth Table Solver
Goal
This code golf challenge is to display a rule that is valid for a given truth table.
Input
The input into the program is a boolean array, though you may choose how this is formatted (array, string, et...
Wireworld is fun for the whole family! Your goal is to create a Wireworld implementation in the shortest amount of code possible.
A Wireworld cell can be in one of four different states, usually numbered 0–3 in software, modeled by colors in the examples here:
Empty (Black)
Electron head (Bl...
I've just closed Shortest Wireworld as a duplicate of Simulate the Wireworld cellular automaton. However, this is one of those lose-lose situations:
Leave the new question open: answers to two essentially identical questions are split between them, or answers to the older one are reposted.
Clos...
Recursive Description
Recently, I made my very first contribution to OEIS by extending and adding a b-file to sequence A049064. The sequence starts with 0, and then the next values are derived from giving a "binary description" of the last item.
For example, the second term would be 10, becaus...
