The paper reports that A*, evolutionary, and reinforcement-learning search can solve 3D hypercube sliding puzzles, and that the stochastic methods find approximate solutions in dimensions 4 and 5 where A* times out.
Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.AI 1years
2024 1verdicts
REJECT 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Approximately Optimal Search on a Higher-dimensional Sliding Puzzle
The paper reports that A*, evolutionary, and reinforcement-learning search can solve 3D hypercube sliding puzzles, and that the stochastic methods find approximate solutions in dimensions 4 and 5 where A* times out.