A new method for the minimisation of Boolean expressions is described. The principal advantage claimed over existing methods is that it does not involve expansion of the given expression. The steps are easy to apply, and well adapted to being programmed. Heuristics methods are not involved.