On the public citation graph

The Number of Knight's Tours Equals 33,439,123,484,294 — Counting with Binary Decision Diagrams

0 signed · 30 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.1038/072364c0openalex-snapshot
Mathematical Recreations and Essays
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/157485.164890openalex-snapshot
Zero-suppressed BDDs for set manipulation in combinatorial problems
inferredcites →https://doi.org/10.2307/3026631openalex-snapshot
Mathematical Recreations and Essays

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-84996-414-2_7openalex-snapshot
Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-30549-1_125openalex-snapshot
Ant Colonies Discover Knight’s Tours
inferred← citeshttps://doi.org/10.1007/978-3-642-35795-4_9openalex-snapshot
A Trustworthy Storage Framework on the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_18openalex-snapshot
A Scalable Approximate Model Counter
inferred← citeshttps://doi.org/10.1007/978-3-642-61012-7_5openalex-snapshot
Knight moves — was macht der Springer allein auf dem Schachbrett?
inferred← citeshttps://doi.org/10.1007/s00283-017-9708-zopenalex-snapshot
Euler et le Parcours du Cavalier, avec une Annexe sur le Théorème des Polyèdres by Jacques Sesiano
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00210-3openalex-snapshot
Optimal ordered binary decision diagrams for read-once formulas
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00063-1openalex-snapshot
Introduction to the constraint language NCL
inferred← citeshttps://doi.org/10.1038/s41598-026-58982-1openalex-snapshot
Hyperchaotic fractional-order image encryption with Knight’s tour scrambling for satellite imagery
inferred← citeshttps://doi.org/10.1080/19361610.2016.1104282openalex-snapshot
Secure Data Hiding Along Randomly Selected Closed Knight's Tour
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02741-xopenalex-snapshot
Counting Hamiltonian cycles in bipartite graphs
inferred← citeshttps://doi.org/10.1109/icacci.2017.8126004openalex-snapshot
A simple recursive backtracking algorithm for knight's tours puzzle on standard 8×8 chessboard
inferred← citeshttps://doi.org/10.1109/ismvl.2003.1201429openalex-snapshot
Using games for benchmarking and representing the complete solution space using symbolic techniques
inferred← citeshttps://doi.org/10.1109/tc.2002.1004587openalex-snapshot
Streaming BDD manipulation
inferred← citeshttps://doi.org/10.1142/s021819671450043xopenalex-snapshot
Lattices of regular closed subsets of closure spaces
inferred← citeshttps://doi.org/10.1155/2014/178585openalex-snapshot
An Effective Privacy-Preserving Algorithm Based on Logistic Map and Rubik’s Cube Transformation
inferred← citeshttps://doi.org/10.18384/2310-7251-2019-1-107-118openalex-snapshot
SIMULATION OF MOTION OF AN OBJECT WITH IMMUTABLE COMPLEX CONFIGURATION IN A CONFINED SPACE
inferred← citeshttps://doi.org/10.2197/ipsjjip.23.272openalex-snapshot
Winning Strategies in Multimove Chess (i, j)
inferred← citeshttps://doi.org/10.26634/jit.4.3.3487openalex-snapshot
Secure Data Hiding By Optimal Placement Ofqueen Along Closed Knight Tour
inferred← citeshttps://doi.org/10.4018/ijisp.2021040103openalex-snapshot
Steganography Technique Inspired by Rook
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5726openalex-snapshot
A Scalable Approximate Model Counter
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6154openalex-snapshot
Winning Strategies in Multimove Chess (i,j)
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6682openalex-snapshot
Sampling Techniques for Boolean Satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.1711.06792openalex-snapshot
Enumeration of Some Closed Knight Paths
inferred← citeshttps://doi.org/10.48550/arxiv.1806.02239openalex-snapshot
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice
inferred← citeshttps://doi.org/10.5539/mas.v10n4p35openalex-snapshot
Implementation of the Binary Random Number Generator Using the Knight Tour 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.