Blog

I was asked to speed the inner loop that runs many times inside a Markov Chain Monte Carlo problem. This post is about different approaches to improving performance. Possibly, some insights here are applicable beyond the details of the specific problem.

I will do this years Advent of Code 2022 in vanilla (only included libraries) python 3.11. I've joined the challenge a few times before - but never finished. Let's see how many days I manage this round :D

A fish tile is formed by two equilateral pentagons - the regular pentagon head, and the pentagonal crescent tail. It is remarkably fun to play with!

I often find myself having to run code for some arbitrary set of different parameters. This can be done with nested `for` loops. This is not pretty, and poses a challenge for paralleization and progress tracking.

There are only 21 ways to place regular polygons in gapless tilings. The point where the polygons meet is called a vertex. Vertices are named by the polygons meeting there. For instance, the vertex where four squares meet is 4.4.4.4. In this post, I will make code to find and draw all possible vertices.