Solving the N-Queens problem with a binary Hopfield-type network |
| |
Authors: | Jacek Mańdziuk |
| |
Affiliation: | (1) Institute of Mathematics, Warsaw University of Technology, Plac Politechniki 1, PL-00-661 Warszawa, Poland |
| |
Abstract: | The application of a discrete Hopfield-type neural network to solving the NP-Hard optimization problem — the N-Queens Problem (NQP) — is presented. The applied network is binary, and at every moment each neuron potential is equal to either 0 or 1. The network can be implemented in the asynchronous mode as well as in the synchronous one with n parallel running processors. In both cases the convergence rate is up to 100%, and the experimental estimate of the average computational complexity is polynomial. Based on the computer simulation results and the theoretical analysis, the proper network parameters are established. The behaviour of the network is explained. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|