Pages that link to "Item:Q1197974"
From MaRDI portal
The following pages link to A dynamic programming solution to the \(n\)-queens problem (Q1197974):
Displaying 17 items.
- An almost perfect heuristic for the N nonattacking queens problem (Q911320) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- A simplified solution of the n queens' problem (Q1098854) (← links)
- Generating Hamiltonian circuits without backtracking from errors (Q1334673) (← links)
- Chasing first queens by integer programming (Q1626730) (← links)
- Solving the N-queens problem using dP systems with active membranes (Q1643128) (← links)
- Solving the \(N\)-Queens puzzle by using few membranes (Q1709885) (← links)
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem (Q2101278) (← links)
- A group-based search for solutions of the \(n\)-queens problem (Q2455580) (← links)
- Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem (Q2636616) (← links)
- Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems (Q2829663) (← links)
- Solution to De Jaenisch's five queens problem (Q3180343) (← links)
- Fast search algorithms for the n-queens problem (Q4017752) (← links)
- Closed-Form Expressions for the n-Queens Problem and Related Problems (Q5243316) (← links)
- Complexity of n-Queens Completion (Q5371006) (← links)
- Computing tighter bounds on the \(n\)-queens constant via Newton's method (Q6097488) (← links)
- The number of \(n\)-queens configurations (Q6098437) (← links)
