A dynamic programming solution to the \(n\)-queens problem

DOI10.1016/0020-0190(92)90168-UzbMath0768.90082OpenAlexW2029486135MaRDI QIDQ1197974

Igor Rivin, Ramin Zabih

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90168-u

zbMATH Keywords

chess\(n\)-queens problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Dynamic programming (90C39)

Related Items (5)

Generating Hamiltonian circuits without backtracking from errors ⋮ Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem ⋮ A group-based search for solutions of the \(n\)-queens problem ⋮ Minimum dominating set of queens: a trivial programming exercise? ⋮ Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems

Cites Work

• Unnamed Item

This page was built for publication: A dynamic programming solution to the \(n\)-queens problem