The problem of packing a fixed number of points into a square while maximizing the distance between them is a good test bed for comparing representations for real optimization problems not based on a simple mathematical formula. The problem does permit the applications of forms of gradient search and so allows simple and hybrid algorithms to be compared. In this study we compare a simple representation comprised of an array of points to a more complex generative representation called the walking triangle representation.