This is a very rough and tumble automated company progression script. its main purpose is to work you through every company that has an augment list (avec un peu de chance), and even auto-promotes you if available!
General Description
This script moves you through every company that has an augment list that I’je suis au courant, checking if you have been invited each, setting you to work if you haven’t, and even auto-promoting you over time! Cela dit, il’s probably full of redundancy, and is less than elegant to put it lightly. je’m self-taught thanks to this game and the various different people making helpful tutorials in here, so I understand if you want or need to tweak it to make the script more efficient.
I should also mention this script won’t work unless you are on or have completed bit node-5, pour des raisons évidentes.
sinon, also included in the script are my creator notes that explain what everything does, plus ou moins. it should help new players who just reached bit node-5 to understand more how some things work if they don’c'est déjà fait. Hope it helps, if nothing else to serve as an example of how badly you can code and still have it work!
P.S.. I know the formatting is as ugly as sin, mais ça’s the best I could do to make copy/pasting easy on people and still keep my notes. Just hit beautify on it, should fix it right up.
Scénario
/** @param {Ns} ns **/ export async function main(ns) { //sets parameters for the script, var invites = ns.checkFactionInvitations() // what invites we have, var completed = []; // companies we have accepted invites from, var busy = ns.isBusy() //whether we're currently working, // and gives us both our company targets and matches each company to their respective city. var city = ["Sector-12", "Sector-12", "Sector-12", "Chongqing", "Volhaven", "Volhaven", "Aevum", "Aevum", "Aevum", "Aevum"] var company = ["Four Sigma", "Blade Industries", "MegaCorp", "KuaiGong International", "NWO", "OmniTek Incorporated", "Clarke Incorporated", "Bachman & Associates", "Fulcrum Secret Technologies", "ECorp"]; alors que (vrai) { var joined = false while (!rejoint) { pour (var career = 0; career < company.length; career++) { //d'abord, we set the loop, sticking on the first company on our array, unless we have an invite //from them already, pour (var i = 0; je < invites.length; i ++) { si (company[career] == invites) { ns.joinFaction(invites); ns.tprint(invites + "has been joined!"); completed.push(company[career]);//then it checks if we completed that company. joined = true; attendre le ns(1000); //fun fact, these times are offset strangely to help me find where the hell my code was screwing // en haut! } Sinon si (company[career] !== invites && company[career] !== completed[career]) {//if we haven't, // we stay with our current company. career = 0 attendre le ns(1100); } Sinon si (company[career] == completed[career]) { //this is probably redundant, but it works so i'm not touching it. ns.tprint("Transfering to " + company[career++]) attendre le ns(1200) } } si (!occupé) { //if we're not working, ns.travelToCity(ville[career]) //we go to our companies city, ns.tprint("Starting work at " + company[career]) // the terminal prints where we are, ns.applyToCompany(company[career], "software"); //we ask nicely for a job or promotion, ns.workForCompany(company[career], "software"); // then we get to work! attendre le ns(60000); //then the script sleeps for a minute } Sinon si (occupé) {// if we're working, ns.tprint("Jour de paie!");// we print a fun payday on terminal, ns.applyToCompany(company[career], "software");// we ask for a promotion, ns.workForCompany(company[career], "software");//and get our money and get back to work, attendre le ns(60000);// then sleep for another minute. } //these are likewise also probably redundant, but i'm not touchin' them. Sinon si (!rejoint) { attendre le ns(1300) } Sinon si (rejoint) { attendre le ns(1400); } } } } }
C'est tout ce que nous partageons aujourd'hui pour cela Brûleur de bits guide. Ce guide a été initialement créé et rédigé par rfdcox. Si nous ne parvenons pas à mettre à jour ce guide, vous pouvez trouver la dernière mise à jour en suivant ceci lien.