Finding valid input for an ALU program. Graph search. DAGs. Virtual machine.

Cuboid subtractions and intersections.

Quantum dice and counting multiverses.

Tree-traversal for snailfish number calculation purposes.

Parsing bits and bytes in Go.

Dijkstra’s shortest path algorithm with a priority queue implemented using container/heap.

Growing petabyte-long molecules at home.

Repeated non-linear transformations.

Very exhaustive cave pathfinding.

Cellular automation in a 2D grid.

Bracket matching/autocompletion using a stack.

Flood fill in a more literal sense. Implemented using DisjointSet, also known as Union-Find algorithm.

Decoding scrambled seven-segment displays using bitwise set operations.

Introduction to crustacean based optimization methods.

Modeling an exponentially growing population of lanternfish.

Helping Santa’s submarine avoid dangerous clusters of hydrothermal vents using a line drawing algorithm.

Implementing the bingo subsystem for Santa’s submarine.

How to render graphs in both Obsidian and Hugo using the same input file.

Hotkeys, tips and tricks for the note taking software Obsidian.

(Norwegian) I dag lærte jeg: Hvis du ønsker å tilgjengeliggjøre en server som kjører på en mobiltelefon, bak en 4G-ruter, eller på en PC med SIM-kort, og er på Telenor-nettverket (Telenor, Vipps Mobil, Fjordkraft, Gudbrandsdal Energi, Happybytes, NorgesEnergi), kan du gjøre følgende: I nettverksinnstillingene på dingsen din, finn “APN” (Access Point Name). Hos Telenor er denne f.eks. telenor.smart eller telenor.fwa. Endre denne til internet.public, og skru av/på flymodus eller restart dingsen din.

Or how to solve a bitwise operations problem using strings.

Computing ups and downs.

Comparing moving windows

It’s happening! Finally December is here, and a new Advent of Code begins. I’ll try to write a very short post for each of my solutions.