On the public citation graph
Eight Queens Problem or N-Queens Problem (Partial Solution to the Problem)
0 signed · 3 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1145/122319.122322openalex-extracted
Explicit solutions to the N -queens problem for all N
inferredcites →https://doi.org/10.1145/568600.568613openalex-extracted
Bit-vector encoding of n-queen problem
inferredcites →https://doi.org/10.2307/2689192openalex-extracted
Constructions for the Solution of the m 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.