A dynamic programming solution to the n-queens problem

DOI10.1016/0020-0190(92)90168-UMaRDI QIDQ1197974zbMATH OpenOpenAlexFDO

Authors Igor Rivin, Ramin Zabih

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0020-0190(92)90168-u

zbMATH Keywords

chess\(n\)-queens problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 1743978
• The crippled Queen placement problem
• Realization of a certain kind of arrangement and solution to the problem of queen control
• scientific article; zbMATH DE number 3993597
• An almost perfect heuristic for the N nonattacking queens problem

Cited in

(23)

• Realization of a certain kind of arrangement and solution to the problem of queen control
• A group-based search for solutions of the \(n\)-queens problem
• Generating Hamiltonian circuits without backtracking from errors
• Chasing first queens by integer programming
• Solution to De Jaenisch's five queens problem
• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
• The number of \(n\)-queens configurations
• scientific article; zbMATH DE number 1779911 (Why is no real title available?)
• Solving the N-queens problem using dP systems with active membranes
• A maximum flow algorithm to locate non-attacking queens of an \(n\times n\) chessboard
• A simplified solution of the n queens' problem
• Fast search algorithms for the n-queens problem
• The eight queens problem as a strategy game
• Minimum dominating set of queens: a trivial programming exercise?
• An almost perfect heuristic for the N nonattacking queens problem
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Complexity of \(n\)-queens completion
• scientific article; zbMATH DE number 1743978 (Why is no real title available?)
• scientific article; zbMATH DE number 2363797 (Why is no real title available?)
• Computing tighter bounds on the \(n\)-queens constant via Newton's method
• Solving the \(N\)-Queens puzzle by using few membranes
• Closed-form expressions for the \(n\)-queens problem and related problems
• Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem

This page was built for publication: A dynamic programming solution to the \(n\)-queens problem

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