Tag: Hamming distance

Comparative Analysis of Four Heuristic Functions that Optimizes the A* Search Algorithm

In  this  chapter are compared  four  heuristic  functions  with  high  efficiency  for an optimum solving  of  8-puzzle. The analysis is realized among Chebyshev distance, Hamming distance and Manhattan distance using A* search algorithm  implemented in  Java.  The  two  heuristic  functions defined  using  Chebyshev  distance  are  more informed than Hamming...
Read More