0 votes

Manhattan Distance does not take into account linear conflicts. For example:

- - 3,1 needs to be changed to - 1, -, 3

[Only first row is being shown here, and the blank is assumed to be at the top left corner.]

Manhattan Distance is 4, but tiles 1 and 3 interfere with each other while moving.

So, how can we improve this heuristic?

in Informed Search by AlgoMeister (1.6k points)

1 Answer

+1 vote
 
Best answer
For every liner conflict, it will take at least 2 more moves, like choose one of them to move down and up. We can add 2 for heuristic as some kinds of penalty.

There seems to be a lot of good solutions to this problem.

http://idm-lab.org/bib/abstracts/papers/aaai07b.pdf
by AlgoMeister (964 points)
selected by
The Book: Analysis and Design of Algorithms | Presentations on Slideshare | Lecture Notes, etc
...