A dynamic programming solution to the \(n\)-queens problem
From MaRDI portal
Publication:1197974
DOI10.1016/0020-0190(92)90168-UzbMath0768.90082OpenAlexW2029486135MaRDI QIDQ1197974
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
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
This page was built for publication: A dynamic programming solution to the \(n\)-queens problem