A simplified solution of the N queens' problem
References (1)
- et al.
A note on the queens' problem
Inform. Process. Lett.
(1986)
Cited by (16)
minimum dominating set of queens: A trivial programming exercise?
2010, Discrete Applied MathematicsA survey of known results and research areas for n-queens
2009, Discrete MathematicsCitation Excerpt :Falkowski and Schmitz’s solution in [64] is given in Fig. 6. Their solution is reduced into four cases in [156] by M. Reichling, and into five cases by J. B. Wu in [196]. Yaglom and Yaglom [197, Section 3] give the solution in Fig. 7.
Linear congruence equations for the solutions of the N-Queens problem
1992, Information Processing LettersAn almost perfect heuristic for the N nonattacking queens problem
1990, Information Processing LettersReducing the time complexity of the n-queens problem
2005, International Journal on Artificial Intelligence ToolsCombinatorial games: Selected bibliography with a succinct gourmetintroduction
2018, Electronic Journal of Combinatorics
Copyright © 1987 Published by Elsevier B.V.