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 5 items.
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- Generating Hamiltonian circuits without backtracking from errors (Q1334673) (← 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)