A bit computing algorithm for the N-queens problem

MaRDI QIDQ3573902zbMATH OpenFDO

Authors Kai Yang, Wenjun Luo

Publication date 8 July 2010

zbMATH Keywords

backtracking search algorithmbit computingN-queens problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Searching and sorting (68P10) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Solving the N-Queens problem using hyperbrid genetic algorithm
• scientific article; zbMATH DE number 1743978
• Algorithm performance for chessboard separation problems
• 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

Cited in

(7)

• A brute-force solution to the 27-queens puzzle using a distributed computation
• Solving the N-Queens problem using hyperbrid genetic algorithm
• Algorithm performance for chessboard separation problems
• scientific article; zbMATH DE number 4063108 (Why is no real title available?)
• Fast search algorithms for the n-queens problem
• scientific article; zbMATH DE number 1863838 (Why is no real title available?)
• Mathematical approach for N-Queens problem with isomorphism

This page was built for publication: A bit computing algorithm for the \(N\)-queens problem

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