The problem of module placement for VLSI circuits is considered for the special case when all modules have approximately the same size and shape. The notion of a routing function is introduced to obtain a 2-dimensional objective function for placement optimization. An algorithm for placement optimization is then presented which employs 'statistical cooling'. Finally, it is shown how this work can be applied to some generalizations of the uniform placement problem.