← Questions
Sliding puzzle: fewest moves to solve the 15-puzzle
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a 4x4 sliding puzzle with one blank, return the fewest moves to reach the solved board, or report that it cannot be solved. Discuss the solvability check, BFS versus A* or IDA* with a Manhattan-distance heuristic, and how you encode states. Only the title of this report was public.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding