well, I'm off to bed... task for tomorrow: find the first of those divisors which satisfies a simple inequality (but keep the overall state consistent such that the thing can be reused). this must be the most effort I put into a single golf since the Prelude quine.
It's more than just the number of types. You have to automate spawn creation, choosing which sources to use, etc.
The "meta-automation"
Hmmm... we can probably do some calculations based on energy usage, without needing many details... as in... each room has a fixed rate of energy production, various items have fixed costs to build, bot parts have a fixed cost and spawning rate, etc.
Identicons are small images of geometric patterns that represent the hash value of a string. Stack Exchange uses the identicons from Gravatar as each user's default avatar image.
In this challenge, we will use the Gravatar identicons as well to generate some text to golf.
Challenge
This stack...
Is anyone else slightly disturbed by the fact that in the binary representation the 0s are meant to represent white but are actually darker than the 1s?
@Calvin'sHobbies I think there's a few cases where the binary version doesn't exactly line up with the original (possible due to aliasing?). An example is Java which has some squiggly lines as some of the edges.
@TheNumberOne All of the sources in survival have 3000 energy regenerated every 300 ticks.
A single body part takes 3 ticks to produce, so a single spawner with a single source must produce bots with an average cost of 30 energy per part in order to continuously spawn.
(not 100% sure on the 3 ticks/part)
A group of three spawners can thus create a single part ever tick, on average.
A single part being worth 100 hits, that is the absolute maximum damage rate per tick a 1-room colony could hypothetically withstand for a non-fleeting moment of time.
That particular limitation is based on the number of spawners.
I think 100 damage per tick is actually a really practical thing for an invading army to produce.
The only defense against that is to have a massive reserve army, but there are limitations on the size of the reserve army based on aging deaths.
An 1800 tick lifespan allows for there to be a reserve army of 18000 hits for a single room. (1 body part produced per tick for the first 1800, after which they are formed and die at the same rate)
Is the situation that you have a list of tasks, have assigned a specific task to that creep, but then you need to check if it's dead to reassign the task?
Let's assume not, for now. You could store a list of assigned tasks in an object, and then filter the list of existing creeps for that task (you would store a copy of the task in the creep's memory as well). If the list is empty, then the creep with that task has died and you should move the task to the "unassigned" list.
Just the one from the tutorial. I'm considering doing a complete rewrite, since my current organization method can't possibly sustain itself in the long run.
At some point we decided to just have one global Sandbox. I think this is fine, I'm just concerned about all the links to old sandboxes that may confuse users, new and old alike.
When I'm not logged in, and viewing the Sandbox, I can see about 7 "Related" questions that also look like sandboxes:...
it's still all very naive, so I feel like <75 should be possible
@Calvin'sHobbies you should probably encourage people to include the identicon in their post, not the rendered output. (so that people can see the challenge they had but without taking up so much space)
is this code golf or meta golf? do we need to write an optimal algorithm, and the score is the size of our code. or does the output not be optimal and the answer is scored on the size of the output?
@AbdouAbdou have a look and let me know if that's what you want
@AbdouAbdou I suggest you try the sandbox next time, so these things can be clarified before you post the actual question and it doesn't get closed right away.
Books on a shelf
code-golf sorting
I have some books and a bookshelf. I would like to put as many books on the shelf as possible but I have a rule. All dimensions of the books (height, width and depth) should form a non-decreasing sequence on the shelf.
This means every books has to be at leas...
@Sp3000 Similar but algorithmically different. Although my question needs a bigO constrait too as the solution is very boring otherwise (e.g. check every permutation of every subset).
There are some ok algorithms for my problem so I will try to find a bigO which let's multiple of them viable.
Your job is to generate a heightmap and show it as a parallel projected, voxel landscape. The rules are the following:
The (heightmap of the) landscape has to be randomly generated
You also have to describe how the algorithm you are using works, so everyone can learn something new here
You have...
@Calvin'sHobbies nice!. For my challenge, I was thinking a different theme. This planet one can serve as a separate challenge all together. Feel free to post it if you want.