examined two simple heuristics for the 8 puzzle: Manhattan distance and misplaced tiles. Several heuristics in the literature purport to improve on this
a. Describe two heuristics (other than Manhattan distance and misplaced tiles) that can be used to improve performance.
b. Implement these heuristics
c. Compare the performance (on a 15-­puzzle rather than the 8?puzzle) of the improved algorithms with the performance of the A* algorithm with the two heuristics introduced in the textbook.
A Python implementation of the 8­?puzzle can be found at
[url removed, login to view]