1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
const MoneyFormat = '$0.0a';
const TimeFormat = '00:00:00';
/** @param {import(".").NS } ns */
export async function main(ns) {
/*
ns.hacknet-auto.script for Bitburner v0.47.2
Winners don't use copyright
Latest version of this script should be at
https://github.com/iuriguilherme/netscripts.d
Bitburner should be at https://github.com/danielyxie/bitburner
This script requires 5.70 GB of RAM to run for 1 thread(s)
This script will buy a ns.hacknet Node, fully upgrade it and then buy the next
one in an infinite loop. If the cost of the next upgrade is higher than
buying a new ns.hacknet Node, then a new one will be bought before the last one
is upgraded. There is an option to set the budget limit.
*/
ns.tail();
ns.moveTail(1650, 825);
ns.resizeTail(250, 100);
// We will not buy anything if there's less money than this ammount
var reserveMoney = 2000;
// How many nodes to buy
var k = 1;
// Number of times to upgrade (shouldn't have to change this)
var n = 1;
ns.disableLog("getServerMoneyAvailable");
ns.disableLog("sleep");
//ns.tail();
ns.print('Waiting to purchase next upgrade...');
// Buy first ns.hacknetNode if there are none
if (
ns.hacknet.numNodes() === 0 &&
ns.getServerMoneyAvailable("home") >= reserveMoney
) {
ns.hacknet.purchaseNode();
displayDashBoard(ns);
}
// If there are no ns.hacknet Nodes, we can't do anything, so the script ends.
while (ns.hacknet.numNodes() > 0) {
// If there is not enough money, we wait for it instead of ending the loop.
while (ns.getServerMoneyAvailable("home") >= reserveMoney) {
for (var i = 0; i < ns.hacknet.numNodes(); i++) {
while (
ns.hacknet.getLevelUpgradeCost(i, n) < Infinity &&
ns.hacknet.upgradeLevel(i, n)
) {
displayDashBoard(ns);
await ns.sleep(100);
}
while (
ns.hacknet.getRamUpgradeCost(i, n) < Infinity &&
ns.hacknet.upgradeRam(i, n)
) {
displayDashBoard(ns);
await ns.sleep(100);
}
while (
ns.hacknet.getCoreUpgradeCost(i, n) < Infinity &&
ns.hacknet.upgradeCore(i, n)
) {
displayDashBoard(ns);
await ns.sleep(100);
}
} // END for (i = 0; i < ns.hacknet.numNodes(); i++)
/*
Buy next ns.hacknet Node if the last one is already fully upgraded.
If for some reason the last ns.hacknet Node is fully upgraded and the
others don't, the loop above will still attempt to upgrade them all.
*/
if (
ns.hacknet.getLevelUpgradeCost((ns.hacknet.numNodes() - 1), n) === Infinity &&
ns.hacknet.getRamUpgradeCost((ns.hacknet.numNodes() - 1), n) === Infinity &&
ns.hacknet.getCoreUpgradeCost((ns.hacknet.numNodes() - 1), n) === Infinity
) {
// Only buy nodes up to k. Past that its not really worth it.
if (ns.hacknet.numNodes() < k) {
ns.hacknet.purchaseNode();
displayDashBoard(ns);
}
} else if (
/*
Or buy the next ns.hacknet Node if the next upgrade is more expensive
than buying a new ns.hacknet Node.
*/
ns.hacknet.getLevelUpgradeCost((ns.hacknet.numNodes() - 1), n) > ns.hacknet.getPurchaseNodeCost() &&
ns.hacknet.getRamUpgradeCost((ns.hacknet.numNodes() - 1), n) > ns.hacknet.getPurchaseNodeCost() &&
ns.hacknet.getCoreUpgradeCost((ns.hacknet.numNodes() - 1), n) > ns.hacknet.getPurchaseNodeCost()
) {
if (ns.hacknet.numNodes() < 2) {
ns.hacknet.purchaseNode();
displayDashBoard(ns);
}
}
await ns.sleep(100);
}
await ns.sleep(100);
}
};
/** @param {import(".").NS } ns */
function displayDashBoard(ns) {
ns.clearLog();
let nodes = Array(ns.hacknet.numNodes()).fill(0);
let maxNodes = ns.hacknet.numNodes() < 2 ? 2 : Infinity
ns.print(`Nodes: ${nodes.length} of ${maxNodes}`);
ns.print(`Total Production: ${nodes.length === 0 ? "$0 /s" : ns.nFormat(nodes.map((v, i) => ns.hacknet.getNodeStats(i).production).reduce((a, b) => a + b), MoneyFormat)} /s`)
ns.print(`Total Produced: ${nodes.length === 0 ? "$0" : ns.nFormat(nodes.map((v, i) => ns.hacknet.getNodeStats(i).totalProduction).reduce((a, b) => a + b), MoneyFormat)}`)
ns.print(table(
["Node", "Produced", "Uptime", "Production", "Lv", "RAM", "Cores"],
nodes.map((v, i) => ns.hacknet.getNodeStats(i).name),
nodes.map((v, i) => ns.nFormat(ns.hacknet.getNodeStats(i).totalProduction, MoneyFormat)),
nodes.map((v, i) => ns.nFormat(ns.hacknet.getNodeStats(i).timeOnline, TimeFormat)),
nodes.map((v, i) => `${ns.nFormat(ns.hacknet.getNodeStats(i).production, MoneyFormat)} /s`),
nodes.map((v, i) => `${ns.hacknet.getNodeStats(i).level}`),
nodes.map((v, i) => `${ns.hacknet.getNodeStats(i).ram}`),
nodes.map((v, i) => `${ns.hacknet.getNodeStats(i).cores}`),
));
}
const MaxReducer = (a, b) => a > b ? a : b;
/**
* Create a Table display of the provided data
* @param {string[]} headers Column Headers
* @param {...string[]} columns Column data
*/
function table(headers, ...columns) {
// Calculate Column Widths
let widths = [];
// for (let i = 0; i < columns.length; i++) {
// widths[i] = columns[i].concat([headers[i]]).map(s => s.length).reduce(MaxReducer);
// }
columns.forEach((c, i) => {
widths[i] = c.concat([headers[i]]).map(s => s.length).reduce(MaxReducer);
});
let output = "\n";
// Write Headers
headers.forEach((h, i) => {
output += ` ${h.padEnd(widths[i], " ")} |`;
});
output += "\n";
// Write Separator
headers.forEach((h, i) => {
output += `${"".padEnd(widths[i] + 2, "=")}|`;
});
output += "\n";
let rows = columns[0].length;
for (let row = 0; row < rows; row++) {
columns.forEach((c, i) => {
if (c[row] == "-") {
output += ` ${"".padEnd(widths[i], "-")} |`;
} else {
output += ` ${c[row].padEnd(widths[i], " ")} |`;
}
});
output += "\n";
}
return output;
}
|
