Problem Difficulty and the Phase Transition in Heuristic Search
Authors: Eldan Cohen, J. Christopher Beck
AAAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | In this work, we perform the first empirical investigation of the phase transition phenomena for heuristic search. |
| Researcher Affiliation | Academia | Eldan Cohen, J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toronto Toronto, Canada {ecohen, jcb}@mie.utoronto.ca |
| Pseudocode | No | No pseudocode or algorithm blocks were found in the paper. |
| Open Source Code | No | The paper does not provide any statements about open-sourcing code or links to a code repository. |
| Open Datasets | No | The paper refers to common benchmark problems like the 8-Pancake Problem, Grid Navigation, Top Spin, and Towers of Hanoi, but does not provide concrete access information (links, DOIs, specific citations to data sources) for these datasets. |
| Dataset Splits | No | The paper describes generating random instances and using benchmark problems, but does not specify train, validation, or test dataset splits in the context of model training or evaluation. |
| Hardware Specification | No | The paper does not provide any specific hardware details used for running the experiments. |
| Software Dependencies | No | The paper does not specify any software dependencies with version numbers. |
| Experiment Setup | Yes | We carried out a series of experiments for n = {10000, 100000, 1000000}, and for 35 γ values in [0, n 1], non-uniformly distributed, with higher density within the mushy region boundaries. For each value of n and p, we generated 1000 random instances. |