A simplified solution of the n queens' problem

DOI10.1016/0020-0190(87)90171-2MaRDI QIDQ1098854zbMATH OpenOpenAlexFDO

Authors Matthias Reichling

Publication date 1987

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(87)90171-2

zbMATH Keywords

n queens' problem

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Review text

In ibid. 23, No.1, 39-46 (1986), \textit{B.-J. Falkowski} and \textit{L. Schmitz} give a solution of the n queens' problem for every \(n>3\), which is composed of seven parts for \(n\in I_ k\), \(k=1,2,...,7.\) The solution presented here consists only of four parts, combining \(I_ 3\) and \(I_ 4\) and \(I_ 5\), \(I_ 6\) and \(I_ 7\) of the above mentioned solution.

Recommendations

• scientific article; zbMATH DE number 3993597
• scientific article; zbMATH DE number 1743978
• A dynamic programming solution to the n-queens problem
• Realization of a certain kind of arrangement and solution to the problem of queen control
• scientific article; zbMATH DE number 4127220

Cited in

(7)

• Linear congruence equations for the solutions of the N-queens problem
• Fast search algorithms for the n-queens problem
• scientific article; zbMATH DE number 1743978 (Why is no real title available?)
• scientific article; zbMATH DE number 3993597 (Why is no real title available?)
• An almost perfect heuristic for the N nonattacking queens problem
• Minimum dominating set of queens: a trivial programming exercise?
• A survey of known results and research areas for \(n\)-queens

This page was built for publication: A simplified solution of the n queens' problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098854)