You are given a weirdly shaped n puzzle (sliding puzzle).
The best way to imagine the shape is that think of 10 x 10 n puzzle (a rather large one), and that some tiles in the center are just fixed - they don't move. (See Slack for an example).
For this problem, what is a good heuristic, from an A Star algorithm perspective? Clearly Manhattan Distance still works, but is that the best?
| Presentations on Slideshare | Lecture Notes, etc