![]() ![]() Lose one point every time one of your EXAs executes a KILL instruction.įor more information see "Hacker Battle Domination" in the second issue of the zine. Gain one point every cycle you control more hosts than your opponent. Reading from a #CTRL register will tell if you (1) or your opponent (-1) controls the host. To take control of a host, write any value to its #CTRL register. To win this battle you must control a majority of the hosts for as long as possible. I first have to beat =plastered before I can play against other people. I think I just threw up into my mouth a little bit. That extreme baseball book you found me was full of interesting information. These unanimous votes make it easy for me to keep count. Next up, a hacker battle against =plastered. Nothing more to say about that, Ember? Well, ok. ![]() I guess it's easier to care about food than an abstract problem. Yeah, that's always the problem with astrology, isn't it? Why would they think Last Stop has actual good food?Īnd why did the guide change their behavior, but not the highway sign?Įveryone seems to be agreeing that the signs were vague. People are choosing to believe the guide even when it's obviously wrong. It's easy to make the code (a bit) smaller, but not without having it be slower as well.Īpparently, that Last Stop location is getting mobbed. I didn't really try but I can imagine getting this under the 75 size limit is impossible. Without going into the nitty gritty, the easiest way to understand this is by running it and seeing which EXA grabs which file.Īs you can see labour is now divided among 3 EXAs. That's apparently very slightly faster than using a single EXA.įor the sake of brevity I'll only post silentsnack's solution here but I want to mention that GuavaMoment's solution has an EXA priority quirk, where depending on what EXA's code you paste in first, it runs at either 23 or 26 cycles.ĬOPY X cycles, 125 lines (so it doesn't count for statistics) They are similar in the sense that they each use two EXAs, one to handle the back rows and one to handle the front rows. Next, both silentsnack and GuavaMoment posted 23-cycle solutions. Those RIGHT2 and RIGHT1 jumps where you end up further down the code if you need to do fewer LINKs are a quite neat solution. I don't know if I can fill the grid faster, and I don't know actually using the coordinates of the correct Eddy's could help. I know faster times are possible but I just cannot figure it out. ![]() All the outer nodes get checked first (cycles 11 and 12), and 10 central nodes all get checked on cycle 13. FJMP EDDY this kills the exa when it's in the wrong nodeĬOPY X FThe farthest nodes need directed EXAs as soon as possible, so I create the farthest east EXA first, then furthest south, then north. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |