On the public citation graph

Constructions for the Solution of the m Queens Problem

0 signed · 27 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 points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3092883openalex-extracted
Eight Queens Problem or N-Queens Problem (Partial Solution to the Problem)
inferred← citeshttps://doi.org/10.1002/9781118557563.biblioopenalex-snapshot
Bibliography
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-319-18476-0_18openalex-snapshot
Enumeration Strategies for Solving Constraint Satisfaction Problems: A Performance Evaluation
inferred← citeshttps://doi.org/10.1007/978-981-10-2053-7_27openalex-snapshot
Decentralizing Volunteer Computing Coordination
inferred← citeshttps://doi.org/10.1007/s00283-019-09963-yopenalex-snapshot
Queens, Attack!
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90259-5openalex-snapshot
Florentine rows or left-right shifted permutation matrices with cross-correlation values ⩽ 1
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90201-8openalex-snapshot
On bounds for a board covering problem
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90156-popenalex-snapshot
Linear congruence equations for the solutions of the N-Queens problem
inferred← citeshttps://doi.org/10.1016/0315-0860(77)90076-3openalex-snapshot
Gauss and the eight queens problem: A study in miniature of the propagation of historical error
inferred← citeshttps://doi.org/10.1016/j.swevo.2016.04.003openalex-snapshot
Using autonomous search for solving constraint satisfaction problems via new modern approaches
inferred← citeshttps://doi.org/10.1016/s0195-6698(86)80002-6openalex-snapshot
Analyse Combinatoire. k-distorsions de [1, n] et de ℕ.
inferred← citeshttps://doi.org/10.1016/s0924-6509(09)70352-6openalex-snapshot
WITHDRAWN: References
inferred← citeshttps://doi.org/10.1017/s1471068414000167openalex-snapshot
A Linear Logic Programming Language for Concurrent Programming over Graph Structures
inferred← citeshttps://doi.org/10.1109/21.135698openalex-snapshot
Fast search algorithms for the n-queens problem
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/csicc58665.2023.10105390openalex-snapshot
Henry V: A linear time algorithm for solving the N-Queens Problem using only 5 patterns
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/icmisi61517.2024.10580520openalex-snapshot
Quantum Answer Set Programming Solver Using Amplitude Amplification
inferred← citeshttps://doi.org/10.1109/icppw.2015.34openalex-snapshot
Achieving Dynamic Workload Balancing for P2P Volunteer Computing
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/ijcnn.2005.1555952openalex-snapshot
A new N-parallel updating method of the Hopfield-type neural network for N-queens problem
inferred← citeshttps://doi.org/10.1111/coin.12300openalex-snapshot
RETRACTED: Parallel genetic algorithm for N‐Queens problem based on message passing interface‐compute unified device architecture
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22444.xopenalex-snapshot
Invulnerable Queens on an Infinite Chessboard
inferred← citeshttps://doi.org/10.1145/131214.131227openalex-snapshot
Different perspectives of the N-Queens problem
inferred← citeshttps://doi.org/10.1145/187387.187400openalex-snapshot
Isomorphism and the N-Queens problem
inferred← citeshttps://doi.org/10.1155/2021/6694944openalex-snapshot
Parallel Implementations of Candidate Solution Evaluation Algorithm for N‐Queens Problem
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.