Optimization of n+1 queens problem using neural networks and ‘the proximity rule of initialization’
| dc.contributor.author | Muhammad Waqas | |
| dc.date.accessioned | 2025-12-17T15:20:15Z | |
| dc.date.available | 2025-12-17T15:20:15Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | The neural networks proved very handy in order to solve combinatorial optimization problems for the last two decades. Especially the Hopfield-Tank neural network model is extensively applied to obtaining an optimal/feasible solution to many different NP combinatory optimization problems like travelling salesman problem (TSP) and NP-hard combinatory optimization problem like N Queens Problem. This thesis describes a neural network optimizer/scheduler that optimizes a solution for a highly complicated version of N Queens Problem, i.e. N+1 non-threatening Queens on a N*N chessboard with an intermediate pawn on it. The behavior of the network is evaluated using asynchronous as well as synchronous mode of updating the neurons. Theoretical soundness of the network is established with simulation. Simulations show that the proposed neural network is capable of finding the optimized solution and is convergent to the global minima in 90% of the trials with polynomial average computational complexity. | |
| dc.identifier.uri | https://escholar.umt.edu.pk/handle/123456789/16684 | |
| dc.language.iso | en | |
| dc.publisher | UMT.Lahore | |
| dc.title | Optimization of n+1 queens problem using neural networks and ‘the proximity rule of initialization’ | |
| dc.type | Thesis |