A*+IDA*: A Simple Hybrid Search Algorithm
Authors: Zhaoxing Bu, Richard E. Korf
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Overall, A*+IDA* is almost five times faster than an efficient implementation of IDA* on the 24-Puzzle with a 6-6-6-6 Pattern Database. We present the speedups of A*+IDA* over IDA* in run time on all 50 test cases in Figure 1. |
| Researcher Affiliation | Academia | Zhaoxing Bu and Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, CA 90095 {zbu, korf}@cs.ucla.edu |
| Pseudocode | No | The paper describes the algorithmic steps in prose within the text but does not include a clearly labeled 'Pseudocode' or 'Algorithm' block, nor any structured, code-like formatted steps. |
| Open Source Code | No | The paper does not provide any explicit statement about releasing its own source code for A*+IDA*, nor does it include a link to a code repository. |
| Open Datasets | Yes | We used the same heuristic function (6-6-6-6 disjoint PDBs with reflection) and the same 50 test cases as in [Korf and Felner, 2002]. |
| Dataset Splits | No | The paper uses a set of 'test cases' for evaluation, but it does not specify explicit training, validation, and test dataset splits with percentages or sample counts, nor does it refer to predefined splits in that context. |
| Hardware Specification | Yes | All experiments were performed on a 3.33GHz Intel Xeon X5680 CPU with 96 GB of RAM. |
| Software Dependencies | No | The paper mentions software components like 'C++ s STL vector' and 'PSVN', and 'Korf s implementation of IDA*', but does not provide specific version numbers for these or any other ancillary software components used in the experiments. |
| Experiment Setup | Yes | We ran A*+IDA* with 8GB, 48GB, and 96GB memory, and the number of nodes stored were 96,855,259, 774,842,075, and 1,549,684,150, respectively. We used the same heuristic function (6-6-6-6 disjoint PDBs with reflection) and the same 50 test cases as in [Korf and Felner, 2002]. After A* runs out of memory, we run a series of iterations of IDA* on frontier nodes without duplicate detection. The first bound is set to be the smallest f-value among all frontier nodes. |