An almost perfect heuristic for the N nonattacking queens problem

DOI10.1016/0020-0190(90)90156-RzbMath0696.68097MaRDI QIDQ911320

Laxmikant V. Kalé

Publication date: 1990

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

zbMATH Keywords

combinatorial problemsheuristic searchbacktracking

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)

Related Items

Generating Hamiltonian circuits without backtracking from errors, Landscape analysis and efficient metaheuristics for solving 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

Cites Work

• Unnamed Item
• Parallel state-space search for a first solution with consistent linear speedups
• A simplified solution of the n queens' problem
• Backtrack programming techniques