Pages that link to "Item:Q998490"

The following pages link to A survey of known results and research areas for \(n\)-queens (Q998490):

Displaying 35 items.

• Recursive construction of non-cyclic pandiagonal Latin squares (Q394233) (← links)
• Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem (Q403007) (← links)
• New decision rules for exact search in \(N\)-queens (Q652694) (← links)
• A \(q\)-queens problem. I: General theory (Q740671) (← links)
• Geometric representation of cubic graphs with four directions (Q833706) (← links)
• Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
• An easy counting lemma (Q1730233) (← links)
• Relation-algebraic modeling and solution of chessboard independence and domination problems (Q1931899) (← links)
• Modular knight distance in graphs and applications on the \(n\)-queens problem (Q2005732) (← 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 partial visibility curve of the Feigenbaum cascade to chaos (Q2124294) (← links)
• The \(n\)-queens completion problem (Q2157925) (← links)
• Constructing non-cyclic pandiagonal Latin squares of prime orders (Q2253905) (← links)
• A \(q\)-queens problem IV. Attacking configurations and their denominators (Q2279971) (← links)
• New constructions for the \(n\)-queens problem (Q2302227) (← links)
• A \(q\)-queens problem. II: The square board (Q2346755) (← links)
• Existence of weakly pandiagonal orthogonal Latin squares (Q2376645) (← links)
• Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem (Q2636616) (← links)
• Art gallery problem with rook and queen vision (Q2657110) (← links)
• Leprechauns on the chessboard (Q2659226) (← links)
• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems (Q2829663) (← links)
• The generalization of rooks problem and quasi-determinant of matrices (Q3178152) (← links)
• Drawing Cubic Graphs with the Four Basic Slopes (Q3223959) (← links)
• A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
• Domination in Chessboards (Q3384118) (← links)
• A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors (Q5217111) (← links)
• Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
• Constructing Pandiagonal Latin Squares from Linear Cellular Automaton on Elementary Abelian Groups (Q5256483) (← links)
• Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
• Computing tighter bounds on the \(n\)-queens constant via Newton's method (Q6097488) (← links)
• The number of \(n\)-queens configurations (Q6098437) (← links)
• Counting Star-Battle configurations (Q6106407) (← links)
• Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions (Q6171759) (← links)
• Composing the queen's exile -- A knighted chain solution to the \(N\)-queens problem (Q6200808) (← links)