Pages that link to "Item:Q4017752"
From MaRDI portal
The following pages link to Fast search algorithms for the n-queens problem (Q4017752):
Displaying 13 items.
- New decision rules for exact search in \(N\)-queens (Q652694) (← links)
- The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms (Q751319) (← links)
- An almost perfect heuristic for the N nonattacking queens problem (Q911320) (← links)
- An analytical evidence for Kalé's heuristic for the \(N\) queens problem (Q1210322) (← links)
- Chasing first queens by integer programming (Q1626730) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- Queens, attack! (Q2019382) (← links)
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem (Q2101278) (← links)
- Search techniques for SAT-based Boolean optimization (Q2455454) (← 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)
- Complexity of n-Queens Completion (Q5371006) (← links)
