Game of Life

For a fun little exercise to improve my knowledge of Haskell, I decided to implement Conway's Game of Life. You can check out the wiki page for details of the game. I will implement it with a finite sized universe, where the cells at the boundary are assumed to ...

more ...

Timetabling

I am interested in using constraint programming to solve a small timetabling problem. I will first describe the problem informally, then have a look at the type of input and output I expect, and finally try to build a formal model.

Problem Description

The problem is to assign a set ...

more ...

Some Lower Bounds for Bin Packing

I talked about the bin backing problem in a previous post. In this post I will look at some of the lower bounds on the number of bins required to pack a given set of items.

These bounds can be quite helpful while searching for an optimal packing because they ...

more ...

The Bin Packing Problem

The bin packing problem (BPP) is a classic combinatorial optimisation problem. The problem is to pack a given set of items, of differing sizes, into a minimum number of containers of a given capacity. The sum of the items in a container cannot exceed the capacity of the containers. It ...

more ...