The following pages link to The n-Queens Problem (Q4324550):
Displaying 22 items.
- The existence of strong complete mappings of finite groups: a survey (Q385380) (← links)
- Extended ensemble Monte Carlo approach to hardly relaxing problems (Q696406) (← links)
- A \(q\)-queens problem. I: General theory (Q740671) (← links)
- The number of transversals in a Latin square (Q851756) (← links)
- On the number of transversals in Cayley tables of cyclic groups (Q968119) (← links)
- A survey of known results and research areas for \(n\)-queens (Q998490) (← links)
- The \(N\)-queens problem on a symmetric Toeplitz matrix (Q1011739) (← links)
- On completing three cyclically generated transversals to a Latin square (Q1017414) (← links)
- On the hardness of counting problems of complete mappings. (Q1426113) (← links)
- Additive triples of bijections, or the toroidal semiqueens problem (Q1725577) (← links)
- Queens, attack! (Q2019382) (← links)
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem (Q2101278) (← links)
- The \(n\)-queens completion problem (Q2157925) (← links)
- Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables (Q2165268) (← links)
- Strong complete mappings for 3-groups (Q2237226) (← links)
- A \(q\)-queens problem IV. Attacking configurations and their denominators (Q2279971) (← links)
- New constructions for the \(n\)-queens problem (Q2302227) (← links)
- Hankel and Toeplitz X-rays of permutations (Q2447974) (← links)
- A group-based search for solutions of the \(n\)-queens problem (Q2455580) (← links)
- The generalization of rooks problem and quasi-determinant of matrices (Q3178152) (← links)
- Transparent fault tolerance for scalable functional computation (Q5371963) (← links)
- The number of \(n\)-queens configurations (Q6098437) (← links)
