The n-Queens Problem
From MaRDI portal
Cited in
(24)- The \(N\)-queens problem on a symmetric Toeplitz matrix
- On completing three cyclically generated transversals to a Latin square
- On the hardness of counting problems of complete mappings.
- Additive triples of bijections, or the toroidal semiqueens problem
- Queens, attack!
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
- The \(n\)-queens completion problem
- Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables
- Strong complete mappings for 3-groups
- A \(q\)-queens problem IV. Attacking configurations and their denominators
- New constructions for the \(n\)-queens problem
- Hankel and Toeplitz X-rays of permutations
- A group-based search for solutions of the \(n\)-queens problem
- The generalization of rooks problem and quasi-determinant of matrices
- The existence of strong complete mappings of finite groups: a survey
- Transparent fault tolerance for scalable functional computation
- The number of n-queens configurations
- On the existence of reflecting n-queens configurations
- Extended ensemble Monte Carlo approach to hardly relaxing problems
- Strong complete mappings for 2-groups
- A q-queens problem. I: General theory
- The number of transversals in a Latin square
- On the number of transversals in Cayley tables of cyclic groups
- A survey of known results and research areas for \(n\)-queens
This page was built for publication: The n-Queens Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324550)
