We attempt to solve the puzzle game “Former” (a variant of SameGame) using graph search algorithms: beam search, A* search, heuristic search and Monte Carlo tree search.

We shrink Dostoevsky’s “Crime and Punishment” to its limit using arithmetic coding. This article showcases my Python implementation of the algorithm.

The dynamic lot size problem is a classic optimization problem. I describe how to implement a linear-time algorithm for solving the dynamic programming recursion.

Some notes on abstract data types and their implementation using data structures. Python examples are included.

Sets and repetitions are essential building blocks in all strength training programs. In this article I present a novel idea: formulating the creation of repetition schemes as a combinatorial optimization problem.

(Norwegian) I denne artikkelen løser vi fordeling av elever på skoler med hensyn til elevenes prioriteter og segregering.

(Norwegian) I denne artikkelen løser vi fordeling av elever på skoler med karakterbaserte hensyn.