-- 7 Billion Humans (2235) -- -- 13: Injection Sites 2 -- step s pickup c a: if c == nothing: step w if w == wall: step s endif endif if w == wall and c == datacube or c == datacube and w == datacube: step e endif jump a They get stuck on the second "IF". Even though it's pretty simple. If there's a wall on your right AND a datacube below you, OR datacube below you and to your right, then step left. Basically, if one of the two combinations apply then step left. I'm confus...

The original https://github.com/hingston/7-billion-humans-solutions seems to be inactive, so I created https://github.com/abfipes12/7-billion-humans-solutions and added some community requested categories. Now a faster solution of the same size or a shorter solution with the same average lead time is considered better hopefully this will give the opportunity to improve solutions and allow more people to compete perhaps this will be merged into the original repository Happy coding also thanks dmr n05ucc...

OCD+ Challenge Solutions GitHub Repository I'd like to create a collection of all the solutions to the optional OCD+ speed and size challenges . So far I've started with my own solutions but if you have a better one I'd love to add it. Either submit a pull request (PREFERRED) or post the code in this thread directly and I'll give you credit on the commit. To submit a solution o...

So I've got the following solution but it fails > 50% of the time. My problem is at label a: 1. bot1 runs [mem1 = nearest datacube]. 2. While bot1 runs [step mem1], bot2 runs [mem1 = nearest datacube]. 3. bot1 successfully runs [pickup mem1] 4. bot2 runs [step mem1] where the safe datacube was. 5. bot2 stays outside of [s == shredder:] (to protect my workers from blowing up) 6. bot2 runs [pickup mem1] since mem1 is already held by bot1 it reassigns mem1 to the next nearest cube. The next nearest cube is ...

The average is usualy rounded not truncated so you have to fail your code in order to success the level ~