New decision rules for exact search in N-queens

DOI10.1007/S10898-011-9653-XMaRDI QIDQ652694zbMATH OpenOpenAlexFDO

Authors Pablo San Segundo

Publication date 15 December 2011

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-011-9653-x

zbMATH Keywords

\(N\)-queensconstraint satisfactiondecision heuristicsglobal searchmaximum clique

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Fast search algorithms for the n-queens problem
• A group-based search for solutions of the \(n\)-queens problem
• An almost perfect heuristic for the N nonattacking queens problem
• An analytical evidence for Kalé's heuristic for the \(N\) queens problem
• scientific article; zbMATH DE number 1743978

Cites work

• A survey of known results and research areas for \(n\)-queens
• An almost perfect heuristic for the N nonattacking queens problem
• Backtrack programming techniques
• scientific article; zbMATH DE number 4112072 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• PARALLEL MEMORY ALLOCATION AND DATA ALIGNMENT IN SIMD MACHINES
• The average complexity of depth-first search with backtracking and cutoff

Cited in

(6)

• An analytical evidence for Kalé's heuristic for 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
• Fast search algorithms for the n-queens problem
• Complexity of n-queens completion
• The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms

Describes a project that uses

Uses Software

• MINION

This page was built for publication: New decision rules for exact search in \(N\)-queens

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