SOLVING THE N-QUEENS PROBLEM WITH A BINARY HOPFIELD-TYPE NETWORK - SYNCHRONOUS AND ASYNCHRONOUS MODEL

The application of a discrete Hopfield-type neural network to solving the NP-Hard optimization problem - the N-Queens Problem (NQP) - is pre sented. The applied network is binary, and at every moment each neuron potential is equal to either 0 or 1. The network can be implemented i n the asynchronous mode as well as in the synchronous one with n paral lel running processors. In both cases the convergence rate is up to 10 0%, and the experimental estimate of the average computational complex ity is polynomial. Based on the computer simulation results and the th eoretical analysis, the proper network parameters are established. The behaviour of the network is explained.