We haven't resolved the exact minimum number of moves required to solve the hardest possible configuration of many classic sliding puzzles.
open
Global / Unspecified, Global
While specific puzzle sizes have been fully solved computationally, generalizing the worst-case difficulty formula across all puzzle sizes remains an open combinatorial question. This links recreational mathematics with formal complexity theory.
Citation ID: WS01270
Title: We haven't resolved the exact minimum number of moves required to solve the hardest possible configuration of many classic sliding puzzles.
URL: https://worldsolve.org/index.php?api=problem&id=1270