An almost perfect heuristic for the N nonattacking queens problem

DOI10.1016/0020-0190(90)90156-RMaRDI QIDQ911320zbMATH OpenFDO

Authors Laxmikant V. Kalé

Publication date 1990

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

zbMATH Keywords

heuristic searchcombinatorial problemsbacktracking

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Recommendations

• An analytical evidence for Kalé's heuristic for 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
• A group-based search for solutions of the \(n\)-queens problem
• A dynamic programming solution to the n-queens problem

Cites work

• scientific article; zbMATH DE number 4090815 (Why is no real title available?)
• A simplified solution of the n queens' problem
• Backtrack programming techniques
• Parallel state-space search for a first solution with consistent linear speedups

Cited in

(14)

• Nonattacking Queens on a Triangle
• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A dynamic programming solution to 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
• Chasing first queens by integer programming
• scientific article; zbMATH DE number 2363797 (Why is no real title available?)
• The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms
• Generating Hamiltonian circuits without backtracking from errors
• Fast search algorithms for the n-queens problem
• New decision rules for exact search in \(N\)-queens
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• An analytical evidence for Kalé's heuristic for the \(N\) queens problem
• Numerical and Symbolic Studies of the Peaceable Queens Problem

This page was built for publication: An almost perfect heuristic for the N nonattacking queens problem

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