Fast search algorithms for the n-queens problem

DOI10.1109/21.135698zbMATH Open0792.68168OpenAlexW2155058940MaRDI QIDQ4017752FDOQ4017752

Rok Sosič, J. Gu

Publication date: 16 January 1993

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/79d2fa13d4a5cfc02ff6936b6083bb620e4e0ce1

Recommendations

• scientific article; zbMATH DE number 1743978
• A dynamic programming solution to the \(n\)-queens problem
• An almost perfect heuristic for the N nonattacking queens problem
• A bit computing algorithm for the \(N\)-queens problem
• A simplified solution of the n queens' problem
• A group-based search for solutions of the \(n\)-queens problem
• scientific article
• scientific article; zbMATH DE number 4127220
• New decision rules for exact search in \(N\)-queens

zbMATH Keywords

artificial intelligencesearch algorithms\(n\)-queens problemAI search strategiesqueen search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Searching and sorting (68P10) Combinatorial inequalities (05A20)

Cited In (15)

• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
• Title not available (Why is that?)
• Chasing first queens by integer programming
• Queens, attack!
• A group-based search for solutions of the \(n\)-queens problem
• A bit computing algorithm for the \(N\)-queens problem
• A maximum flow algorithm to locate non-attacking queens of an \(n\times n\) chessboard
• The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms
• The \(Multi\)-SAT algorithm
• Title not available (Why is that?)
• Search techniques for SAT-based Boolean optimization
• An almost perfect heuristic for the N nonattacking queens problem
• An analytical evidence for Kalé's heuristic for the \(N\) queens problem
• Title not available (Why is that?)

This page was built for publication: Fast search algorithms for the n-queens problem

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