Sliding puzzle: fewest moves to solve the 15-puzzle
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.
MicrosoftCodingNo answer yet. Write the first one; the best answer gets endorsed.