Recent posts

GLOW impressions

I visited GLOW for the first time this year. My expectations were high, and while there were some beautiful projects to behold, there wasn’t anything that made me go “wow”. Still, it was a nice way to spend my Friday evening. I’ll definitely visit again next year.  read full post

SHENZHEN I/O, part 4

Time for some more electronics engineering with SHENZHEN I/O.  read full post

SHENZHEN I/O, part 3

After a 40 hour work week of computer programming, what better way to spend a saturday than more programming? For no pay? For a non-existent company? This is what it’s all about with SHENZHEN I/O. On to our next assignment!  read full post

SHENZHEN I/O, part 2

We’re continuing our dream of becoming a world-class embedded systems engineer. Well, a virtual one, at least. This is more programming puzzling with SHENZHEN I/O.  read full post

SHENZHEN I/O, part 1

Have you ever dreamt of moving to China to work as an embedded systems engineer? Me neither. Fortunately, a recently released video game will now let you live out the fantasy you never knew you had.  read full post

Packaging dependent assemblies in a .NET executable

When redistributing a .NET app, there’s usually a couple of dependent assemblies (outside the main .NET framework) that go with it. These can be from a third party (e.g. NuGet packages), or they can be class libraries within the same solution. In this post, I’ll focus on the latter. I’ll show how to use the Visual Studio build process to package class libraries from a solution into an app from that same solution. The result will be a single, fully portable executable that contains all class libaries it depends on and can run from anywhere as long as the .NET framework itself is installed.  read full post

Finding the most valuable Monopoly properties

I think everyone has at least heard of the game of Monopoly. It’s been years since I last played it, but the game still facinates me. I’ve always wondered if it was possible to build a monopoly AI who could play the game flawlessly, and what the most optimal strategy was. I won’t be going that far in this post, but I will attempt to find the most valuable property spaces. I’ll do this by simulating a whole bunch of monopoly games, and keeping track of how many times each property space is visited. I’ll be using Python 3 for this project.  read full post