A survey of known results and research areas for n-queens
DOI10.1016/J.DISC.2007.12.043zbMATH Open1228.05002OpenAlexW2080042417WikidataQ56047936 ScholiaQ56047936MaRDI QIDQ998490FDOQ998490
Authors: Jordan Bell, Brett Stevens
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) History of mathematics in the 19th century (01A55) History of combinatorics (05-03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The On-Line Encyclopedia of Integer Sequences
- Counting monomials
- Title not available (Why is that?)
- Enumerative combinatorics. Volume 2.
- Construction and properties of Costas arrays.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper bound on the number of complete maps
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating Solutions to the N-Queens Problem Using 2-Circulants
- The number of transversals in a Latin square
- Nonattacking Queens on a Triangle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A complete solution to the existence and nonexistence of Knut Vik designs and orthogonal Knut Vik designs
- The n-Queens Problem
- Constructing orthogonal pandiagonal Latin squares and panmagic squares from modularn-queens solutions
- Title not available (Why is that?)
- Enumeration and construction of pandiagonal Latin squares of prime order
- Title not available (Why is that?)
- Title not available (Why is that?)
- A geometrical picture book
- Maximal partial spreads and the modular \(n\)-queen problem. III
- The zen of magic squares, circles, and stars. An exhibition of surprising structures across dimensions
- Title not available (Why is that?)
- Extended ensemble Monte Carlo approach to hardly relaxing problems
- Maximal partial spreads and the modular \(n\)-queen problem. II
- Maximal partial spreads and the modular \(n\)-queen problem
- Tight logic programs
- Gauss and the eight queens problem: A study in miniature of the propagation of historical error
- On the queens problem on the torus
- The modular n-queen problem. II
- On the modular \(n\)-queen problem
- Partial \(n\)-solutions to the modular \(n\)-queen problem
- The modular \(n\)-queens problem in higher dimensions
- Title not available (Why is that?)
- The n-queens problem
- Some Packing Problems
- On the queen graphs coloring problem.
- Queens graphs
- A contribution to queens graphs: a substitution method
- Chessboard graphs, related designs, and domination parameters
- Title not available (Why is that?)
- A simplified solution of the n queens' problem
- Theoretical Limitations on the Efficient Use of Parallel Memories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating stable permutations
- Florentine rows or left-right shifted permutation matrices with cross- correlation values \(\leq 1\)
- Linear congruence equations for the solutions of the \(N\)-queens problem
- The modular n-queen problem
- Generalized Latin squares on the torus
- On the hardness of counting problems of complete mappings.
- Latin squares and superqueens
- Independent permutations, as related to a problem of Moser and a theorem of Polya
- The \(n\)-queens problem in higher dimensions
- Queens graphs for chessboards on the torus
- Birkhoff's Theorem for Panstochastic Matrices
- Title not available (Why is that?)
- An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles
- Title not available (Why is that?)
- Independence and domination separation on chessboard graphs
- A Combinatorial Theorem on Circulant Matrices
- Title not available (Why is that?)
- On McCarty's Queen Squares
- Title not available (Why is that?)
- 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
- Queen Squares
- Title not available (Why is that?)
- Statistical mechanics of a two-dimensional system with long-range interactions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Figures of Constant Width on a Chessboard
- Title not available (Why is that?)
- Title not available (Why is that?)
- The queens separation problem
- Results for the \(n\)-queens problem on the Möbius board
- Arrays and brooks
- On Coloring the n × n Chessboard
- The Problem of Reflecting Queens
- Title not available (Why is that?)
- Title not available (Why is that?)
- On pairings of the first 2n natural numbers
Cited In (39)
- Recursive construction of non-cyclic pandiagonal Latin squares
- The number of \(n\)-queens configurations
- The \(n\)-queens completion problem
- New constructions for the \(n\)-queens problem
- Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem
- Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
- Asymptotic speedup via effect handlers
- An easy counting lemma
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular knight distance in graphs and applications on the \(n\)-queens problem
- Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem
- Relation-algebraic modeling and solution of chessboard independence and domination problems
- Counting Star-Battle configurations
- Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
- A new mathematical model for tiling finite regions of the plane with polyominoes
- Queens, attack!
- Art gallery problem with rook and queen vision
- A linear time solution for \(N\)-queens problem using generalized networks of evolutionary polarized processors
- Constructing pandiagonal Latin squares from linear cellular automaton on elementary abelian groups
- Drawing Cubic Graphs with the Four Basic Slopes
- Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
- Existence of weakly pandiagonal orthogonal Latin squares
- The generalization of rooks problem and quasi-determinant of matrices
- The gonality of queen's graphs
- A \(q\)-queens problem. I: General theory
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Leprechauns on the chessboard
- A \(q\)-queens problem IV. Attacking configurations and their denominators
- Composing the queen's exile -- A knighted chain solution to the \(N\)-queens problem
- Constructing non-cyclic pandiagonal Latin squares of prime orders
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- Computing tighter bounds on the \(n\)-queens constant via Newton's method
- Domination in chessboards
- A \(q\)-queens problem. II: The square board
- Geometric representation of cubic graphs with four directions
- New decision rules for exact search in \(N\)-queens
- On the queens problem on the torus
- The partial visibility curve of the Feigenbaum cascade to chaos
Uses Software
This page was built for publication: A survey of known results and research areas for \(n\)-queens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998490)