Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems

DOI10.1007/978-3-319-11271-8_6MaRDI QIDQ2829663zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Nasrin Mohabbati-Kalejahi, Hossein Akbaripour, Ellips Masehian

Publication date 8 November 2016

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11271-8_6

zbMATH Keywords

imperialist competitive algorithmhybrid imperialist competitive algorithmeffective swap operatornon-attacking \(n\)-queens problemnon-dominating \(n\)-queens problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An almost perfect heuristic for the N nonattacking queens problem
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Fast search algorithms for the n-queens problem
• scientific article; zbMATH DE number 1743978
• scientific article; zbMATH DE number 1051284
• A dynamic programming solution to the n-queens problem
• Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem
• A maximum flow algorithm to locate non-attacking queens of an \(n\times n\) chessboard

Cites work

• A dynamic programming solution to the \(n\)-queens problem
• A survey of known results and research areas for \(n\)-queens
• Context-independent scatter and tabu search for permutation problems
• New decision rules for exact search in \(N\)-queens

Cited in

(4)

• Solving the \(N\)-Queens problem using hyperbrid genetic algorithm
• An almost perfect heuristic for the N nonattacking queens problem
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829663)