![]() Then it runs the same code to copy the safe's combination to the clock as before.Īnd that's it for my optimizations. The correct EXA kills the vampires, then waits some more until every other EXA read the target host, gets the DOOR and UNLOCKED from XA and updates the file. Now, XA sends the target hostname 5 times, so that every other XB instance can check if they're there. During this time the other EXAs are spinning their wheels. The one that does find it jumps to FOUNDTALISMAN, gets the MAP keyword from XA, finds the target's location, sens that to XA, gets the DOOR from XA, and sends UNLOCKED to XA. The ones that do NOT find it go into a wait loop (29 iterations seemed to work), so they don't try reading from M before everything is ready. ![]() Replace the HALT after FOUNDUNLOCKED with ![]() Just use that to KILL all those EXAs in the center host that are taking ages to loop down to zero. So the mutex8021 EXA has cycles to spare. When the XB in mutex8021's hideout is done, the XB in the target is still doing its thing. With this current solution, there's a simple way to lower the cycle count significantly. ![]() Finally, it sends the combination again so the target EXA can write it. It sends the SAFE so the target EXA can get the combination, then stores the safe's combination for a bit and sends the CLOCK, giving the target EXA the space to find the clock in the file. XA has been timed to start sending as soon as XB is done with M. The XB REPL in the target kills the vampires, then uses the data from the first XB to unlock the door. The XB in mutex8021's hideout continues to find the DOOR and then sends DOOR and UNLOCKED on M. XB goes looking for the TALISMAN, then finds the MAP and makes a REPL to go locate the target. XA sends the TALISMAN, MAP and DOOR and then waits for a while. To find UNLOCKED, I add another COPY F M to XA, and replace that HALT in XB with: For instance, one of the vampires has a black trench coat, sunglasses, and flask of blood. In case you were wondering, the files that the other EXAs are holding are their character's inventories. That way the new one can GRAB 200 to do the final steps. If so, it does a bunch of KILLs, killing all vampires, but also our own EXA which might still be trying to find the TALISMAN over there. The REPL does much the same as before (it's slow but easy to code, and there's plenty of space in the central host anyway), then each REPL checks if it's in the right host. The original XB instance just HALTs for now, but I kept it because I'll be needing it to grab the UNLOCKED instance from mutex8021's door. It then makes a REPL that goes looking for the target. I'll have to take it bit by bit.ĭIVI 1 T T HLT IF 200Once the XB that found the TALISMAN also finds the map, it stores the location of the target in X. Note that the door to mutex8021's hideout will always be UNLOCKED. Next, travel to the target host, disconnect the vampire players by terminating their EXAs, set the DOOR to UNLOCKED and copy the SAFE combination to the CLOCK so that mutex8021 can read it and empty the safe. Then find the MAP in the hideout and use it to locate the target host: the secret vampire lair. First, locate mutex8021's hideout by finding the TALISMAN (file 300). Each host contains an item listing (file 200) that lists all of the items in that location (ID, type, and state). No talks with Ember, I just jump right in. I guess my hacking is just to cheat at games now? I think 1998 in the description is the year. Let's just start with the top one, Bloodlust Online with mutex8021. All I know is that the puzzles won't get any easier. From here on out, the LP is mostly blind. This is actually the point where I stopped playing during my initial playthrough. The actual chat is still disconnected but it looks like I got a bunch of tasks to do with or for our chat friends. There is nothing new to do in the main assignment list, but a new task tabs has appeared in Chatsubo. Welcome to the post-game.Įverything looks much the same. I don't get nearly enough opportunities to link to the title theme. Only a few lines to handle a lot of logic. The second time, when looking for the right host from the sorting method, T contains a value so sending the HOST is skipped, and then the #NERV is only sent if the host name actually matches the value in X. The #NERV itself is never copied because X is also 0 and by that time the HOST sits in T. First round, when MARK HOST is reached T is still 0, so the HOST is copied if the #NERV exists. Also, those tests and jumps at the very bottom are a neat combination. The shortened sorting method also removed the lowest value from the file every round, making the sorting go faster and faster. DIVI #NERV T M575/129/192 and a modified version with slight tweaks runs 92
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |