A survey of known results and research areas for \(n\)-queens
From MaRDI portal
Publication:998490
DOI10.1016/j.disc.2007.12.043zbMath1228.05002OpenAlexW2080042417WikidataQ56047936 ScholiaQ56047936MaRDI QIDQ998490
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.043
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) History of mathematics in the 19th century (01A55) History of combinatorics (05-03)
Related Items
The partial visibility curve of the Feigenbaum cascade to chaos ⋮ Geometric representation of cubic graphs with four directions ⋮ Existence of weakly pandiagonal orthogonal Latin squares ⋮ The generalization of rooks problem and quasi-determinant of matrices ⋮ Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ The \(n\)-queens completion problem ⋮ Art gallery problem with rook and queen vision ⋮ Leprechauns on the chessboard ⋮ Recursive construction of non-cyclic pandiagonal Latin squares ⋮ Relation-algebraic modeling and solution of chessboard independence and domination problems ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem ⋮ Computing tighter bounds on the \(n\)-queens constant via Newton's method ⋮ The number of \(n\)-queens configurations ⋮ Counting Star-Battle configurations ⋮ Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions ⋮ Composing the queen's exile -- A knighted chain solution to the \(N\)-queens problem ⋮ New decision rules for exact search in \(N\)-queens ⋮ An easy counting lemma ⋮ Constructing non-cyclic pandiagonal Latin squares of prime orders ⋮ Modular knight distance in graphs and applications on the \(n\)-queens problem ⋮ Queens, attack! ⋮ A \(q\)-queens problem IV. Attacking configurations and their denominators ⋮ A \(q\)-queens problem. I: General theory ⋮ A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors ⋮ Synchronization problems in automata without non-trivial cycles ⋮ New constructions for the \(n\)-queens problem ⋮ Domination in Chessboards ⋮ Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems ⋮ Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata ⋮ Constructing Pandiagonal Latin Squares from Linear Cellular Automaton on Elementary Abelian Groups ⋮ Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem ⋮ A new mathematical model for tiling finite regions of the plane with polyominoes ⋮ A \(q\)-queens problem. II: The square board
Uses Software
Cites Work
- On the queens problem on the torus
- Maximal partial spreads and the modular \(n\)-queen problem
- Extended ensemble Monte Carlo approach to hardly relaxing problems
- Enumeration and construction of pandiagonal Latin squares of prime order
- On the queen graphs coloring problem.
- The number of transversals in a Latin square
- Generating stable permutations
- A simplified solution of the n queens' problem
- The modular n-queen problem. II
- Florentine rows or left-right shifted permutation matrices with cross- correlation values \(\leq 1\)
- On the modular \(n\)-queen problem
- Linear congruence equations for the solutions of the \(N\)-queens problem
- Partial \(n\)-solutions to the modular \(n\)-queen problem
- A complete solution to the existence and nonexistence of Knut Vik designs and orthogonal Knut Vik designs
- The n-queens problem
- The modular n-queen problem
- Gauss and the eight queens problem: A study in miniature of the propagation of historical error
- Generalized Latin squares on the torus
- Chessboard graphs, related designs, and domination parameters
- Queens graphs
- Upper bound on the number of complete maps
- A geometrical picture book
- On the hardness of counting problems of complete mappings.
- Latin squares and superqueens
- Maximal partial spreads and the modular \(n\)-queen problem. II
- The modular \(n\)-queens problem in higher dimensions
- Independent permutations, as related to a problem of Moser and a theorem of Polya
- The \(n\)-queens problem in higher dimensions
- A contribution to queens graphs: a substitution method
- Counting monomials
- Constructions and properties of Costas arrays
- Birkhoff's Theorem for Panstochastic Matrices
- Some Packing Problems
- An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles
- Nonattacking Queens on a Triangle
- Constructing orthogonal pandiagonal Latin squares and panmagic squares from modularn-queens solutions
- A Combinatorial Theorem on Circulant Matrices
- On McCarty's Queen Squares
- Some Computer Solutions to the Reflecting Queens Problem
- Constructions for the Solution of the m Queens Problem
- A Theorem about Primes Proved on a Chessboard
- Theoretical Limitations on the Efficient Use of Parallel Memories
- Queen Squares
- The n-Queens Problem
- Statistical mechanics of a two-dimensional system with long-range interactions
- Tight logic programs
- Generating Solutions to the N-Queens Problem Using 2-Circulants
- Figures of Constant Width on a Chessboard
- Arrays and brooks
- On Coloring the n × n Chessboard
- The Problem of Reflecting Queens
- On pairings of the first 2n natural numbers
- Maximal partial spreads and the modular \(n\)-queen problem. III
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
