scientific article; zbMATH DE number 1743978

MaRDI QIDQ4529455zbMATH OpenFDO

Authors Dorothy Bollman, Edusmildo Orozco

Publication date 2 July 2002

zbMATH Keywords

\(n\)-queens problem

Mathematics Subject Classification ID

Designs and configurations (05B99) Nonnumerical algorithms (68W05)

Recommendations

• A dynamic programming solution to the n-queens problem
• A simplified solution of the n queens' problem
• Fast search algorithms for the n-queens problem
• Generating Solutions to the N-Queens Problem Using 2-Circulants
• A group-based search for solutions of the \(n\)-queens problem

Cited in

(18)

• A simplified solution of the n queens' problem
• A dynamic programming solution to the n-queens problem
• An analytical evidence for Kalé's heuristic for the \(N\) queens problem
• Chasing first queens by integer programming
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• A group-based search for solutions of the \(n\)-queens problem
• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
• Realization of a certain kind of arrangement and solution to the problem of queen control
• A bit computing algorithm for the N-queens problem
• A maximum flow algorithm to locate non-attacking queens of an n n chessboard
• The eight queens problem as a strategy game
• Fast search algorithms for the n-queens problem
• scientific article; zbMATH DE number 2014718 (Why is no real title available?)
• scientific article; zbMATH DE number 1779911 (Why is no real title available?)
• Generating Solutions to the N-Queens Problem Using 2-Circulants
• Complexity of n-queens completion
• Computing tighter bounds on the \(n\)-queens constant via Newton's method
• New decision rules for exact search in \(N\)-queens

This page was built for publication:

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