Fl1ght.exe bitburner how to#

The #threads math is working out for me currently to ~ 1 hack : 12 grow : 1 weaken per cycle (all calculations are performed at minimum server security level).īasically you run a single cycle of what's shown above per server. I have currently achieved the fl1ght.exe milestone and working towards the red pill, with a hacking level of over 3.1k and all 30 ish augmentations from pre-flight. Would rather find a clean non-workaround solution. I have over a PB currently so 600k copies.). However, a) have not found (yet) an automated way to create multiple copies, b) when you have > 1 TB on a server you have to create a lot of copies (at ~1.7 GB per thread consumption, you are looking at a touch over 600 instances.

) and execute them through a for loop with an ns.exec call having a different filename each time.

A workaround is to generate duplicate scripts (e.g. I receive the run time error that the relevant weaken/grow/hack scripts I am calling from a master script file are already running.

Fl1ght.exe bitburner how to#

Problem: I have not figured out in ns1 or ns2 code how to run concurrent cycles on the same server. 1 thread, cycle 3, starts & finishes shortly after cycle 1| g threads ditto as cycle 1| h threads ditto as cycle 1 1 thread, cycle 2, starts & finishes shortly after cycle 1| g threads ditto as cycle 1| h threads ditto as cycle 1 | h threads threads finish off right before grow finishes | g threads threads finish off right before weaken finishes There are two solutions, one of which I am not sure it is practically possible: I assume the OP's objectives are to keep the server at both max money and minimum security (this results in maximum $$/sec, if that is your ultimate goal).

At some point you realize you have to apply a Lambert W function (warning: semi-advanced math :-) to solve for the right combination of grow, hack and weaken threads. If you look up the functions for hack, grow, and weaken, it'll give you the right numbers to use to calculate the right number of threads.īut, the math is not as straightforward.