On the public citation graph

Fast search algorithms for the n-queens problem

0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01692200openalex-snapshot
Mathematische Unterhaltungen und Spiele
inferredcites →https://doi.org/10.1016/0020-0190(86)90128-6openalex-snapshot
A note on the queen's problem
inferredcites →https://doi.org/10.1016/0020-0190(87)90171-2openalex-snapshot
A simplified solution of the N queens' problem
inferredcites →https://doi.org/10.1016/0020-0190(90)90156-ropenalex-snapshot
An almost perfect heuristic for the N nonattacking queens problem
inferredcites →https://doi.org/10.1080/0025570x.1969.11975924openalex-snapshot
Constructions for the Solution of the m Queens Problem
inferredcites →https://doi.org/10.1109/64.54670openalex-snapshot
Representation selection for constraint satisfaction: a case study using n-queens
inferredcites →https://doi.org/10.1137/0217008openalex-snapshot
Expected Performance of m -Solution Backtracking
inferredcites →https://doi.org/10.1145/101340.101343openalex-snapshot
A polynomial time algorithm for the N-Queens problem
inferredcites →https://doi.org/10.1147/rd.303.0242openalex-snapshot
The average complexity of depth-first search with backtracking and cutoff
inferredcites →https://doi.org/10.1147/rd.314.0464openalex-snapshot
Efficient search techniques—An empirical study of the N-Queens Problem
inferredcites →https://doi.org/10.2307/2689192openalex-snapshot
Constructions for the Solution of the m Queens Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jpdc.2000.1712openalex-snapshot
The Shared Control Parallel Architecture Model
inferred← citeshttps://doi.org/10.1007/978-1-4471-2063-6_326openalex-snapshot
A Harmony Theory Network Solution To The N-Queens Problem
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_5openalex-snapshot
Parallel Algorithms for Satisfiability (SAT) Testing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_30openalex-snapshot
Multispace Search for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_77openalex-snapshot
An Efficient Learning Algorithm for Feedforward Neural Network
inferred← citeshttps://doi.org/10.1007/bfb0057970openalex-snapshot
Shared control — Supporting control parallelism using a SIMD-like architecture
inferred← citeshttps://doi.org/10.1007/s00283-019-09963-yopenalex-snapshot
Queens, Attack!
inferred← citeshttps://doi.org/10.1016/0925-2312(95)00023-yopenalex-snapshot
Design of neurocomputer architectures for large-scale constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.biosystems.2015.03.004openalex-snapshot
A parallel algorithm for solving the n-queens problem based on inspired computational model
inferred← citeshttps://doi.org/10.1016/j.enconman.2022.115468openalex-snapshot
Photovoltaic array reconfiguration under partial shading conditions for maximum power extraction: A state-of-the-art review and new solution method
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2006.01.003openalex-snapshot
Search techniques for SAT-based Boolean optimization
inferred← citeshttps://doi.org/10.1016/j.sbspro.2013.06.118openalex-snapshot
A Polynomial-Time DNA Computing Solution for the N-Queens Problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1016/s1874-5946(98)80043-6openalex-snapshot
Short time memory problems
inferred← citeshttps://doi.org/10.1016/s1874-5946(98)80072-2openalex-snapshot
Short time memory problems
inferred← citeshttps://doi.org/10.1023/a:1008287028851openalex-snapshot
A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems
inferred← citeshttps://doi.org/10.1023/a:1008294209959openalex-snapshot
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
inferred← citeshttps://doi.org/10.1023/a:1011211220465openalex-snapshot
A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems
inferred← citeshttps://doi.org/10.1109/12.485373openalex-snapshot
Convergence properties of optimization algorithms for the SAT problem
inferred← citeshttps://doi.org/10.1109/21.247892openalex-snapshot
Local search for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/21.281425openalex-snapshot
A bibliography of heuristic search research through 1992
inferred← citeshttps://doi.org/10.1109/21.293486openalex-snapshot
Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP)
inferred← citeshttps://doi.org/10.1109/43.256919openalex-snapshot
Microword length minimization in microprogrammed controller synthesis
inferred← citeshttps://doi.org/10.1109/69.317698openalex-snapshot
Efficient local search with conflict minimization: a case study of the n-queens problem
inferred← citeshttps://doi.org/10.1109/69.334864openalex-snapshot
Global optimization for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/71.932715openalex-snapshot
Efficient local search far DAG scheduling
inferred← citeshttps://doi.org/10.1109/72.950153openalex-snapshot
Cooperative updating in the Hopfield model
inferred← citeshttps://doi.org/10.1109/ccece.2008.4564490openalex-snapshot
Efficiency competition on N-queen problem: DE vs. CMA-ES
inferred← citeshttps://doi.org/10.1109/icecco.2014.6997584openalex-snapshot
Rakhya's method: A case based approach to solve n-queens problem
inferred← citeshttps://doi.org/10.1109/icpp.1996.537394openalex-snapshot
FAST: a low-complexity algorithm for efficient scheduling of DAGs on parallel processors
inferred← citeshttps://doi.org/10.1109/icpp.1997.622584openalex-snapshot
Local search for DAG scheduling and task assignment
inferred← citeshttps://doi.org/10.1109/icstcc.2014.6982509openalex-snapshot
Rakhya's method: A case based approach to solve n-queens problem
inferred← citeshttps://doi.org/10.1109/idap68205.2025.11222204openalex-snapshot
Malatya Centrality Algorithm and Graph Colouring Based Effective and Efficient Eight Queen Problem Solution Method
inferred← citeshttps://doi.org/10.1109/saci.2011.5873061openalex-snapshot
Accelerating N-queens problem using OpenMP
inferred← citeshttps://doi.org/10.1109/tetc.2013.2273359openalex-snapshot
Vita: A Crowdsensing-Oriented Mobile Cyber-Physical System
inferred← citeshttps://doi.org/10.1109/wicom.2008.346openalex-snapshot
LDPC Block-Coding Schedule Based on Queen-Matrix
inferred← citeshttps://doi.org/10.1109/words.1999.806576openalex-snapshot
Dependability of on-line optimization techniques in real-time applications
inferred← citeshttps://doi.org/10.1137/s0097539793256053openalex-snapshot
Probe Order Backtracking
inferred← citeshttps://doi.org/10.1142/s0218213005002247openalex-snapshot
REDUCING THE TIME COMPLEXITY OF THE N-QUEENS PROBLEM
inferred← citeshttps://doi.org/10.1145/1138403.1138429openalex-snapshot
Las Vegas does n-queens
inferred← citeshttps://doi.org/10.1145/2442116.2442134openalex-snapshot
Market-based resource allocation for distributed data processing in wireless sensor networks
inferred← citeshttps://doi.org/10.2339/politeknik.762967openalex-snapshot
A Linear Time Pattern Based Algorithm for N-Queens Problem
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.195-196.1049openalex-snapshot
An Orbit-Based Search Algorithm to Solve N-Queens Problem
inferred← citeshttps://doi.org/10.48550/arxiv.0910.4545openalex-snapshot
Introduction to Randomness and Statistics
inferred← citeshttps://doi.org/10.5555/1071509.1071564openalex-snapshot
N-queens pattern generation: an insight into space complexity of a backtracking algorithm
inferred← citeshttps://doi.org/10.5815/ijcnis.2011.03.03openalex-snapshot
An Algebraic Method for the N-Queens Problem Based on Permutation Operation Group
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.