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

Authors
Citation
J. Mandziuk, SOLVING THE N-QUEENS PROBLEM WITH A BINARY HOPFIELD-TYPE NETWORK - SYNCHRONOUS AND ASYNCHRONOUS MODEL, Biological cybernetics, 72(5), 1995, pp. 439-445
Citations number
10
Categorie Soggetti
Computer Science Cybernetics","Biology Miscellaneous
Journal title
ISSN journal
03401200
Volume
72
Issue
5
Year of publication
1995
Pages
439 - 445
Database
ISI
SICI code
0340-1200(1995)72:5<439:STNPWA>2.0.ZU;2-3
Abstract
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.