bitburner VS adventofcode

Bitburner which is available on steam or web which is more sci fi/hacking themed. it's a very complex life loop game that involves coding heavily. There is a pseudo code script in the game in which you can write programs to hack others and eventually restart with cybernetic implants. You can even ditch the pseudo script and code directly in java in the game. The end game is quite fun and fulfilling. I haven't even gotten through it yet.

Nope, ports communicate "in RAM" only, i.e. when you close and re-open the game (or complete a BitNode [and maybe also if you install augs? Don't know]) they're cleared. Ports can be accessed via ns.writePort() and ns.peek() or ns.readPort() and be cleared manually with ns.clearPort(). The docs have syntax and description of all the in-game functions.

From the source code:

3.https://danielyxie.github.io/bitburner (optional, for extra practice and motivation)

Here's a list of functions if you want to take a look at what's available. https://github.com/danielyxie/bitburner/blob/dev/markdown/bitburner.ns.md

RTFM for [ns.ps()](https://github.com/danielyxie/bitburner/blob/dev/markdown/bitburner.ns.ps.md) and ns.killall() ;)

Bitburner.

Looking at the Warehouse API, the only way to get information on a product is to already know the product name. However if I, for example, restart my corp script after augment installs with a corporation already running, I wouldn't have any of my product names in memory. I know that, given that you can only ever have at most 5 products at a time, I could just create a static list of 5 product names and infer my current production from there but it would be nice to not have to do that and be able to run a function like getProducts that would pull a dictionary/list of the current products for me. I'm generally trying to avoid coding w/ try/catch blocks so something like that would be nice.

However, if you have access to formulas at whatever time you're running this script, you can try fitting in the ns.Formulas.growPercent(target, maxGrowThreads, ns.getPlayer()) method.

On GitHub.

My Scala solution – to be cleaned up.

Welcome back to my series of Advent of Code solutions in MiniScript! Day 18 was pretty straightforward, though it presents some interesting choices in how to represent the data -- choices I'm not sure I made optimally.

My Scala solution.

And I've solved all of the Advent of Code problems so far this year, which is utterly unimportant but still brings me joy.

If you'd enjoy some coding challenges, advent of code (https://adventofcode.com/) is currently going on.

Welcome back to my series of Advent of Code solutions in MiniScript! In Day 17 we got to (sort of) play Tetris. Five different Tetris-like shapes fall into a pit, moved left or right on each step according to the input. The first task is to see how high this stack will grow after 2022 blocks have been dropped in.

Welcome back to my series of Advent of Code solutions in MiniScript! Day 16 was... how to put this?