Heuristic search routine for Magic-N Squares puzzle?

Hi,

Does anyone know where I can obtain a LISP program to compute the

solution of a Magic-N-Square puzzle when given the value of N? I'm

looking for one which uses a heuristic search function such as the

Hill Climbing method, Iterative Deepening, A*, or any other similar

methods. Is there one out there?

Steve