Fast search algorithms for the n-queens problem

DOI10.1109/21.135698MaRDI QIDQ4017752zbMATH OpenOpenAlexFDO

Authors Rok Sosič, J. Gu

Publication date 16 January 1993

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/79d2fa13d4a5cfc02ff6936b6083bb620e4e0ce1

zbMATH Keywords

\(n\)-queens problemAI search strategiesartificial intelligencequeen searchsearch algorithms

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Searching and sorting (68P10) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1743978
• A dynamic programming solution to the n-queens problem
• An almost perfect heuristic for the N nonattacking queens problem
• A bit computing algorithm for the N-queens problem
• A simplified solution of the n queens' problem
• A group-based search for solutions of the \(n\)-queens problem
• scientific article; zbMATH DE number 4212061
• scientific article; zbMATH DE number 4127220
• New decision rules for exact search in \(N\)-queens

Cited in

(18)

• An analytical evidence for Kalé's heuristic for the \(N\) queens problem
• Chasing first queens by integer programming
• The Multi-SAT algorithm
• Queens, attack!
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Search techniques for SAT-based Boolean optimization
• A group-based search for solutions of the \(n\)-queens problem
• Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem
• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
• A bit computing algorithm for the N-queens problem
• A maximum flow algorithm to locate non-attacking queens of an n n chessboard
• scientific article; zbMATH DE number 2014718 (Why is no real title available?)
• scientific article; zbMATH DE number 1743978 (Why is no real title available?)
• scientific article; zbMATH DE number 1779911 (Why is no real title available?)
• Complexity of n-queens completion
• New decision rules for exact search in \(N\)-queens
• The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms
• An almost perfect heuristic for the N nonattacking queens problem

This page was built for publication: Fast search algorithms for the n-queens problem

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