A simulated annealing artificial neural network implementation of the n‐queens problem

Abstract

A Harmony Theory artificial neural network implementation of the n-queens problem is presented in this piece of research. The problem is encoded in the two layers of the artificial neural network in such a manner that the inherent constraints of the problem are made directly available. Subsequently, during the simulated annealing procedure of Harmony Theory, maximal constraint satisfaction is accomplished in parallel and an optimal solution of the n-queens problem is produced. This solution indicates the appropriate locations of the greatest possible number of queens that can be placed on the n × n chessboard in a valid configuration, i.e., so that no queen threatens or is threatened by another queen. The proposed parallel implementation of the n-queens problem, combined with the application of the simulated annealing procedure, offers an interesting alternative to existing techniques (e.g., search, constraint propagation) in terms of optimality as well as computational and time efficiency. © 1997 John Wiley & Sons, Inc.