An almost perfect heuristic for the N nonattacking queens problem
References (5)
A simplified solution to the n queens problem
Inform. Process. Lett.
(1987)- et al.
Backtrack programming techniques
Comm. ACM
(1975)
Cited by (21)
A parallel algorithm for solving the n-queens problem based on inspired computational model
2015, BioSystemsCitation Excerpt :Brute-force algorithms try to find all the solutions by checking all these arrangements, but this is unpractical for large values of n. Thus several different approaches have been proposed in literatures to solve the n-queens problem without listing technique. Some of these are as follows: using of backtracking search (Bitner and Reingold, 1975), local search and conflict minimization techniques (Sosic and Gu, 1994), neural networks (Onomi et al., 2011; Bharitkar and Mendel, 2000), search heuristic methods (Kale, 1990), probabilistic local search algorithms (Sosic and Gu, 1991) and integer programming (Foulds and Johnston, 1984). The n-queens Problem, a generalization of the original 8-queens problem, asks whether n nonattacking queens can be placed on an n × n chessboard in such a way that no queen can attack another, i.e., so that no two queens are placed in the same row or column or on the same diagonal.
Generating Hamiltonian circuits without backtracking from errors
1994, Theoretical Computer ScienceAn analytical evidence for Kalé's heuristic for the N queens problem
1993, Information Processing LettersMinimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
1992, Artificial IntelligenceThe hysteretic Hopfield neural network
2000, IEEE Transactions on Neural NetworksLandscape analysis and efficient metaheuristics for solving the n-queens problem
2013, Computational Optimization and Applications