On the public citation graph

Solving the 24 Puzzle with Instance Dependent Pattern Databases

0 signed · 31 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/3-540-44914-0_18openalex-snapshot
Experiments with Automatically Created Memory-Based Heuristics
inferredcites →https://doi.org/10.1007/978-3-540-73580-9openalex-snapshot
Abstraction, Reformulation, and Approximation
inferredcites →https://doi.org/10.1016/s0004-3702(01)00092-3openalex-snapshot
Disjoint pattern database heuristics
inferredcites →https://doi.org/10.1111/0824-7935.00065openalex-snapshot
Pattern Databases
inferredcites →https://doi.org/10.1613/jair.1480openalex-snapshot
Additive Pattern Database Heuristics
inferredcites →https://doi.org/10.5555/777092.777206openalex-snapshot
Memory-efficient A* heuristics for multiple sequence alignment

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.1833openalex-snapshot
MR‐search: massively parallel heuristic search
inferred← citeshttps://doi.org/10.1007/978-3-030-70594-7_12openalex-snapshot
Near Optimal Solving of the (N$$^2$$–1)-puzzle Using Heuristics Based on Artificial Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-05428-5_2openalex-snapshot
Building Large Compressed PDBs for the Sliding Tile Puzzle
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_5openalex-snapshot
Partial Pattern Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-74128-2_3openalex-snapshot
Automated Creation of Pattern Database Search Heuristics
inferred← citeshttps://doi.org/10.1007/978-981-15-0035-0_40openalex-snapshot
An N-Puzzle Solver Using Tissue P System with Evolutional Symport/Antiport Rules and Cell Division
inferred← citeshttps://doi.org/10.1007/s10472-010-9195-9openalex-snapshot
New methods for proving the impossibility to solve problems through reduction of problem spaces
inferred← citeshttps://doi.org/10.1016/j.artint.2011.08.001openalex-snapshot
Learning heuristic functions for large state spaces
inferred← citeshttps://doi.org/10.1109/lra.2020.2967326openalex-snapshot
DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics
inferred← citeshttps://doi.org/10.1145/1851476.1851592openalex-snapshot
Very large pattern databases for heuristic search
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7563openalex-snapshot
Searching Without a Heuristic: Efficient Use of Abstraction
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10665openalex-snapshot
Value Compression of Pattern Databases
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6752openalex-snapshot
Utilising Uncertainty for Efficient Learning of Likely-Admissible Heuristics
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18500openalex-snapshot
Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18159openalex-snapshot
Bootstrap Learning of Heuristic Functions
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18162openalex-snapshot
Additive Heuristic for Four-Connected Gridworlds
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18259openalex-snapshot
A* Variants for Optimal Multi-Agent Pathfinding
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18290openalex-snapshot
Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
inferred← citeshttps://doi.org/10.1613/jair.2241openalex-snapshot
Compressed Pattern Databases
inferred← citeshttps://doi.org/10.1613/jair.2486openalex-snapshot
A General Theory of Additive State Space Abstractions
inferred← citeshttps://doi.org/10.1613/jair.4171openalex-snapshot
Enhanced Partial Expansion A*
inferred← citeshttps://doi.org/10.3897/jucs.65202openalex-snapshot
15-Puzzle Problem Solving with the Artificial Bee Colony Algorithm Based on Pattern Database
inferred← citeshttps://doi.org/10.5120/8347-1894openalex-snapshot
Genetic based Algorithm for N - Puzzle Problem
inferred← citeshttps://doi.org/10.7939/r3fw8wopenalex-snapshot
Additive abstraction-based heuristics
inferred← citeshttps://doi.org/10.7939/r3qp6jopenalex-snapshot
Bootstrap Learning of Heuristic Functions
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.