Pages that link to "Item:Q911320"
From MaRDI portal
The following pages link to An almost perfect heuristic for the N nonattacking queens problem (Q911320):
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)
- A dynamic programming solution to the \(n\)-queens problem (Q1197974) (← links)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869) (← links)
- An analytical evidence for Kalé's heuristic for the \(N\) queens problem (Q1210322) (← links)
- Generating Hamiltonian circuits without backtracking from errors (Q1334673) (← links)
- Chasing first queens by integer programming (Q1626730) (← 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)
- Nonattacking Queens on a Triangle (Q3369915) (← links)
- Fast search algorithms for the n-queens problem (Q4017752) (← links)
- Numerical and Symbolic Studies of the Peaceable Queens Problem (Q5070655) (← links)
- A $q$-Queens Problem. III. Nonattacking Partial Queens (Q5197599) (← links)
