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.
Graph puzzles, homotopy, and the alternating group
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
REJECT 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.