Manhattan8

Same as Manhattan3 but weighted by 8. This heuristic is better with large maps but can miss the solution on small maps as:
d(A,B) = 8 * (|XA - XB| + |YA - YB|)

Line Graph

Theses graphics represents the courbes of time and complexity on 50 maps.
The differents colors reprensents differents algorithm as:

AStar

AStar3

AStar8

MultStar

AverageStar