๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A neural network designed to solve the N-Queens Problem

โœ Scribed by Jacek Mandziuk; Bohdan Macuk

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
451 KB
Volume
66
Category
Article
ISSN
0340-1200

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper we discuss the Hopfield neural network designed to solve the N-Queens Problem (NQP). Our network exhibits good performance in escaping from local minima of energy surface of the problem. Only in approximately 1% of trials it settles in a false stable state (local minimum of energy). Extensive simulations indicate that the network is efficient and less sensitive to changes of its initial energy (potentials of neurons). Two strategies employed to achieve the solution and results of computer simulation are presented. Some theoretical remarks about convergence of the network are added.

๐Ÿ“œ SIMILAR VOLUMES

A simulated annealing artificial neural
A simulated annealing artificial neural network implementation of the n-queens problem
โœ T. Tambouratzis ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 138 KB ๐Ÿ‘ 2 views

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,

Solving the N-bit parity problem using n
Solving the N-bit parity problem using neural networks
โœ Myron E Hohil; Derong Liu; Stanley H Smith ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 48 KB

In this letter, a constructive solution to the N-bit parity problem is provided with a neural network that allows direct connections between the input layer and the output layer. The present approach requires no training and adaptation, and thus it warrants the use of the simple threshold activation

A neural network approach to the classif
A neural network approach to the classification problem
โœ James W. Denton; Ming S. Hung; Barbara A. Osyk ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 612 KB

The task of classifying observations into known groups is a common problem in decision making. A wealth of statistical approaches, commencing with Fisher's linear discriminant function, and including variations to accommodate a variety of modeling assumptions, have been proposed. In addition, nonpar

A heuristic circulation-network approach
A heuristic circulation-network approach to solve the multi-traveling salesman problem
โœ Alberto Garcia-Diaz ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 561 KB

The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the