Manhattan3

Same as Manhattan but the distance is weighted by 3. This technique is faster but gives a less precise result in number of strokes as:
d(A,B) = 3 * (|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