This paper discusses a method for solving an LSI module placement prob
lem using the Kohonen network. First, it is clarified how the neighbor
hood relations affect the solution called feature map. Specifically, e
ach synapse weight vector is located at the gravitational center of th
e neighboring synapse weight vectors. Then, it is shown how to set the
neighborhood relations to locate the synapse weight vectors at the la
ttice points, which is necessary in solving the placement problem. Fin
ally, it is shown by computer simulations that performance of the modi
fied Kohonen network is between those of the simulated annealing and t
he Min-cut methods.