A dynamic programming solution to the n-queens problem
From MaRDI portal
A dynamic programming solution to the \(n\)-queens problem
Recommendations
Cited in
(24)- A simplified solution of the n queens' problem
- Generating Hamiltonian circuits without backtracking from errors
- Chasing first queens by integer programming
- Solving the N-queens problem using dP systems with active membranes
- Solving the \(N\)-Queens puzzle by using few membranes
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
- A group-based search for solutions of 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
- Solution to De Jaenisch's five queens problem
- Realization of a certain kind of arrangement and solution to the problem of queen control
- A maximum flow algorithm to locate non-attacking queens of an n n chessboard
- The eight queens problem as a strategy game
- Fast search algorithms for the n-queens problem
- scientific article; zbMATH DE number 1743978 (Why is no real title available?)
- scientific article; zbMATH DE number 1779911 (Why is no real title available?)
- Closed-form expressions for the n-queens problem and related problems
- Complexity of n-queens completion
- scientific article; zbMATH DE number 2363797 (Why is no real title available?)
- Computing tighter bounds on the \(n\)-queens constant via Newton's method
- The number of n-queens configurations
- ETH lower bounds for n-queens: time waits for nobody
- An almost perfect heuristic for the N nonattacking queens problem
- Minimum dominating set of queens: a trivial programming exercise?
This page was built for publication: A dynamic programming solution to the \(n\)-queens problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197974)
